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

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

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Goldengorin, Boris (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2018.
Edition:1st ed. 2018.
Series:Springer Optimization and Its Applications, 139
Springer eBook Collection.
Subjects:
Mathematical optimization.
Business logistics.
Combinatorics.
Algorithms.
Graph theory.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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).

Similar Items