Optimization Problems in Graph Theory In Honor of Gregory Z. Gutin's 60th Birthday /

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Goldengorin, Boris (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
Έκδοση:1st ed. 2018.
Σειρά:Springer Optimization and Its Applications, 139
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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).