© 2005

Graph Theory and Combinatorial Optimization

  • David Avis
  • Alain Hertz
  • Odile Marcotte

Table of contents

  1. Front Matter
    Pages i-xv
  2. Slim Belhaiza, Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira
    Pages 1-16
  3. Peter Brass, János Pach
    Pages 17-36
  4. Komei Fukuda, Vera Rosta
    Pages 37-67
  5. Alain Hertz, Vadim V. Lozin
    Pages 69-99
  6. Kartik Krishnan, Tamás Terlaky
    Pages 101-157
  7. Wieslaw Kubiak
    Pages 159-189
  8. Patrice Marcotte, Gilles Savard
    Pages 191-217
  9. F.B. Shepherd, A. Vetta
    Pages 219-254
  10. Dominique de Werra
    Pages 255-264

About this book


Graph theory is very much tied to the geometric properties of optimization and combinatorial optimization. Moreover, graph theory's geometric properties are at the core of many research interests in operations research and applied mathematics. Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.

Graph Theory and Combinatorial Optimization explores the field's classical foundations and its developing theories, ideas and applications to new problems. The book examines the geometric properties of graph theory and its widening uses in combinatorial optimization theory and application. The field's leading researchers have contributed chapters in their areas of expertise.


Graph Graph theory Hypergraph Optimization Theory algorithm algorithms combinatorial optimization operations research optimization programming

Editors and affiliations

  • David Avis
    • 1
  • Alain Hertz
    • 2
  • Odile Marcotte
    • 3
  1. 1.McGill University & GERADMontréalCanada
  2. 2.École Polytechnique de Montréal & GERADMontréalCanada
  3. 3.Université du Québec a Montréal and GERADMontréalCanada

Bibliographic information