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
"Sinopsis" puede pertenecer a otra edición de este libro.
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
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: 5bc79bcef592d9f5f7d51f093252d852
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 352 pp. Englisch. Nº de ref. del artículo: 9783030069216
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents open optimization problems in graph theory and networksFeatures advanced methods and techniques in combinatorial optimization and directed graphsHighlights applications to design efficient algorithmsThis book pres. Nº de ref. del artículo: 448670229
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9783030069216
Cantidad disponible: 1 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 instancesSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 352 pp. Englisch. Nº de ref. del artículo: 9783030069216
Cantidad disponible: 1 disponibles
Librería: Books Puddle, Woodside, NY, Estados Unidos de America
Condición: New. pp. 349. Nº de ref. del artículo: 26380633078
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 349. Nº de ref. del artículo: 383270953
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 349. Nº de ref. del artículo: 18380633084
Cantidad disponible: 4 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Paperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA80030300692146
Cantidad disponible: 1 disponibles