Graph Theory and Combinatorial Optimization

Edited by David Avis, Alain Hertz and Odile Marcotte

in Springer Books from Springer

Date: 2005
ISBN: 978-0-387-25592-7
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Chapters in this book:

Ch Chapter 1 Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity

Slim Belhaiza, Nair Maria Maia Abreu, Pierre Hansen and Carla Silva Oliveira

Ch Chapter 2 Problems and Results on Geometric Patterns

Peter Brass and János Pach

Ch Chapter 3 Data Depth and Maximum Feasible Subsystems

Komei Fukuda and Vera Rosta

Ch Chapter 4 The Maximum Independent Set Problem and Augmenting Graphs

Alain Hertz and Vadim V. Lozin

Ch Chapter 5 Interior Point and Semidefinite Approaches in Combinatorial Optimization

Kartik Krishnan and Tamás Terlaky

Ch Chapter 6 Balancing Mixed-Model Supply Chains

Wieslaw Kubiak

Ch Chapter 7 Bilevel Programming: A Combinatorial Perspective

Patrice Marcotte and Gilles Savard

Ch Chapter 8 Visualizing, Finding and Packing Dijoins

F.B. Shepherd and A. Vetta

Ch Chapter 9 Hypergraph Coloring by Bichromatic Exchanges

Dominique Werra

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-0-387-25592-7

Ordering information: This item can be ordered from
http://www.springer.com/9780387255927

DOI: 10.1007/b135661

Access Statistics for this book

More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().