Goldengorin Boris Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin`s 60th Birthday 9783319948294

Варианты приобретения

Цена: 11878.00р.
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: Есть
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Goldengorin Boris
Название: Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin`s 60th Birthday
ISBN: 9783319948294
Издательство: Springer
Классификация:

Исламска теология

Управление в конкретных областях

Основы высшей математики и математический анализ

Вычислительная математика

Оптимизация

Комбинаторика и теория графов

ISBN-10: 3319948296
Обложка/Формат: Hardcover
Страницы: 331
Вес: 0.67 кг.
Дата издания: 11.10.2018
Серия: Springer optimization and its applications
Язык: English
Издание: 1st ed. 2018
Иллюстрации: 22 illustrations, color; 65 illustrations, black and white; xviii, 331 p. 87 illus., 22 illus. in color.
Размер: 234 x 156 x 21
Читательская аудитория: General (us: trade)
Подзаголовок: In honor of gregory z. gutin`s 60th birthday
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include:· Algorithmic aspects of problems with disjoint cycles in graphs· Graphs where maximal cliques and stable sets intersect· The maximum independent set problem with special classes· A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints· Algorithms for computing the frustration index of a signed graph· A heuristic approach for studying the patrol problem on a graph· Minimum possible sum and product of the proper connection number· Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances
Дополнительное описание: Gregory Gutin and Graph Optimization Problems (Noga Alon).- On graphs whose maximal cliques and stable sets intersect (Diogo V. Andrade and Endre Boros and Vladimir Gurvich).- Computing the Line Index of Balance Using Integer Programming Optimisation (Sam

Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin`s 60th Birthday, Goldengorin Boris