Skip to main content
SpringerLink
Log in
Book cover

Optimization Problems in Graph Theory

In Honor of Gregory Z. Gutin's 60th Birthday

  • Book
  • © 2018

Overview

Editors:
  1. Boris Goldengorin

    1. Department of Information Systems and Decision Science, Merrick School of Business, University of Baltimore, Baltimore, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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

Part of the book series: Springer Optimization and Its Applications (SOIA, volume 139)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Pages i-xviii
    Download chapter PDF

  2. Gregory Gutin and Graph Optimization Problems

    • Noga Alon
    Pages 1-2

  3. On Graphs Whose Maximal Cliques and Stable Sets Intersect

    • Diogo V. Andrade, Endre Boros, Vladimir Gurvich
    Pages 3-63

  4. Computing the Line Index of Balance Using Integer Programming Optimisation

    • Samin Aref, Andrew J. Mason, Mark C. Wilson
    Pages 65-84

  5. Optimal Factorization of Operators by Operators That Are Consistent with the Graph’s Structure

    • Victoria Goncharenko, Yuri Goncharenko, Sergey Lyashko, Vladimir Semenov
    Pages 85-91

  6. Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results

    • Jørgen Bang-Jensen, Gregory Gutin
    Pages 93-106

  7. Dominance Certificates for Combinatorial Optimization Problems

    • Daniel Berend, Steven S. Skiena, Yochai Twitto
    Pages 107-122

  8. Conditional Markov Chain Search for the Simple Plant Location Problem Improves Upper Bounds on Twelve Körkel–Ghosh Instances

    • Daniel Karapetyan, Boris Goldengorin
    Pages 123-147

  9. 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
    Pages 149-168

  10. Combinatorial and Graph-Theoretical Problems and Augmenting Technique

    • Ngoc C. Lê
    Pages 169-213

  11. Optimal Patrol on a Graph Against Random and Strategic Attackers

    • Richard G. McGrath
    Pages 215-263

  12. Network Design Problem with Cut Constraints

    • Firdovsi Sharifov, Hakan Kutucu
    Pages 265-292

  13. Process Sequencing Problem in Distributed Manufacturing Process Planning

    • Dusan Sormaz, Arkopaul Sarkar
    Pages 293-324

  14. Sharp Nordhaus–Gaddum-Type Lower Bounds for Proper Connection Numbers of Graphs

    • Yuefang Sun
    Pages 325-331
Back to top

Keywords

About this book

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

Editors and Affiliations

  • Department of Information Systems and Decision Science, Merrick School of Business, University of Baltimore, Baltimore, USA

    Boris Goldengorin

Bibliographic Information

  • Book Title: Optimization Problems in Graph Theory

  • Book Subtitle: In Honor of Gregory Z. Gutin's 60th Birthday

  • Editors: Boris Goldengorin

  • Series Title: Springer Optimization and Its Applications

  • DOI: https://doi.org/10.1007/978-3-319-94830-0

  • Publisher: Springer Cham

  • eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)

  • Copyright Information: Springer Nature Switzerland AG 2018

  • Hardcover ISBN: 978-3-319-94829-4Published: 11 October 2018

  • Softcover ISBN: 978-3-030-06921-6Published: 13 December 2018

  • eBook ISBN: 978-3-319-94830-0Published: 27 September 2018

  • Series ISSN: 1931-6828

  • Series E-ISSN: 1931-6836

  • Edition Number: 1

  • Number of Pages: XVIII, 331

  • Number of Illustrations: 65 b/w illustrations, 22 illustrations in colour

  • Topics: Optimization, Logistics, Combinatorics, Algorithms, Graph Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation