Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday: Springer Optimization and Its Applications, cartea 139
Editat de Boris Goldengorinen Limba Engleză Hardback – 11 oct 2018
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
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 484.25 lei 38-45 zile | |
Springer International Publishing – 13 dec 2018 | 484.25 lei 38-45 zile | |
Hardback (1) | 714.32 lei 6-8 săpt. | |
Springer International Publishing – 11 oct 2018 | 714.32 lei 6-8 săpt. |
Din seria Springer Optimization and Its Applications
- 15% Preț: 623.61 lei
- 15% Preț: 645.58 lei
- 14% Preț: 979.50 lei
- 17% Preț: 360.79 lei
- 13% Preț: 461.35 lei
- Preț: 339.21 lei
- 18% Preț: 765.32 lei
- Preț: 370.04 lei
- 23% Preț: 624.04 lei
- 18% Preț: 1100.76 lei
- 15% Preț: 627.93 lei
- 15% Preț: 628.87 lei
- Preț: 389.09 lei
- Preț: 369.05 lei
- Preț: 383.88 lei
- Preț: 388.46 lei
- Preț: 530.66 lei
- 15% Preț: 628.87 lei
- Preț: 379.14 lei
- 15% Preț: 631.25 lei
- 24% Preț: 611.54 lei
- 18% Preț: 944.70 lei
- 20% Preț: 585.90 lei
- 15% Preț: 689.75 lei
- 18% Preț: 721.34 lei
- 15% Preț: 639.37 lei
- 15% Preț: 640.14 lei
- 18% Preț: 723.80 lei
- 15% Preț: 685.11 lei
Preț: 714.32 lei
Preț vechi: 871.11 lei
-18% Nou
Puncte Express: 1071
Preț estimativ în valută:
136.70€ • 143.78$ • 113.87£
136.70€ • 143.78$ • 113.87£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319948294
ISBN-10: 3319948296
Pagini: 279
Ilustrații: XVIII, 331 p. 87 illus., 22 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.67 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Springer Optimization and Its Applications
Locul publicării:Cham, Switzerland
ISBN-10: 3319948296
Pagini: 279
Ilustrații: XVIII, 331 p. 87 illus., 22 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.67 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Springer Optimization and Its Applications
Locul publicării:Cham, Switzerland
Cuprins
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 (Samin Aref, Andrew J. Mason and Mark C. Wilson).- Branching in Digraphs with Many and Few leaves: Structural and Algorithmic Results (Jørgen Bang-Jensen and Gregory Gutin).- Dominance Certificates for Combinatorial Optimization Problems (Daniel Berend and Steven S. Skiena and Yochai Twitto).- Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances (Daniel Karapetyan and Boris Goldengorin).- An algorithmic answer to the Ore-type version of Dirac’s question on disjoint cycles (H.A. Kierstead, A.V. Kostochka, T. Molla, D. Yager).- Optimal Patrol on a Graph against Random and Strategic Attackers (Richard G. McGrath).- Network Design Problem with Cut Constraints (Firdovsi Sharifov and Hakan Kutucu).- Process Sequencing Problem in Distributed Manufacturing Process Planning (Dusan Sormaz and Arkopaul Sarkar).- Sharp Nordhaus-Gaddum-type lower bounds for proper connection numbers of graphs (Yuefang Sun).
Textul de pe ultima copertă
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
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
Caracteristici
Presents open optimization problems in graph theory and networks Features advanced methods and techniques in combinatorial optimization and directed graphs Highlights applications to design efficient algorithms