Esta web utiliza cookies propias y de terceros que nos permiten optimizar tu experiencia en el sitio web, evaluar su rendimiento, generar estadísticas de uso y mejorar y añadir nuevas funcionalidades. Mediante el análisis de tus hábitos de navegación podemos mostrar contenidos más relevantes y medir las interacciones con la web.
Puede obtener más información aquí.

Avanzado
Artículos
Portada

OPTIMIZATION PROBLEMS IN GRAPH THEORY IBD

BORIS GOLDENGORIN
SPRINGER
10 / 2018
9783319948294
Inglés

Sinopsis

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