Skip to main content
  • Book
  • © 2005

Graph Theory and Combinatorial Optimization

  • A current treatment of cutting-edge topics in Graph Theory and Combinatorial Optimization by leading researchers
  • Includes heuristic advances and novel approaches to solving combinatorial optimization problems

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.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

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

Table of contents (9 chapters)

  1. Front Matter

    Pages i-xv
  2. Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity

    • Slim Belhaiza, Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira
    Pages 1-16
  3. Problems and Results on Geometric Patterns

    • Peter Brass, János Pach
    Pages 17-36
  4. Data Depth and Maximum Feasible Subsystems

    • Komei Fukuda, Vera Rosta
    Pages 37-67
  5. The Maximum Independent Set Problem and Augmenting Graphs

    • Alain Hertz, Vadim V. Lozin
    Pages 69-99
  6. Interior Point and Semidefinite Approaches in Combinatorial Optimization

    • Kartik Krishnan, Tamás Terlaky
    Pages 101-157
  7. Balancing Mixed-Model Supply Chains

    • Wieslaw Kubiak
    Pages 159-189
  8. Bilevel Programming: A Combinatorial Perspective

    • Patrice Marcotte, Gilles Savard
    Pages 191-217
  9. Visualizing, Finding and Packing Dijoins

    • F.B. Shepherd, A. Vetta
    Pages 219-254
  10. Hypergraph Coloring by Bichromatic Exchanges

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

Editors and Affiliations

  • McGill University & GERAD, Montréal, Canada

    David Avis

  • École Polytechnique de Montréal & GERAD, Montréal, Canada

    Alain Hertz

  • Université du Québec a Montréal and GERAD, Montréal, Canada

    Odile Marcotte

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.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