Logo - springer
Slogan - springer

Mathematics - Applications | Combinatorial Optimization - Polyhedra and Efficiency

Combinatorial Optimization

Polyhedra and Efficiency

Series: Algorithms and Combinatorics, Vol. 24

Schrijver, Alexander

2003, XXXIII, 1881 p. In 3 volumes, not available separately.


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

(net) price for USA

ISBN 978-3-540-44389-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

Content Level » Research

Keywords » YellowSale2006 - combinatorial optimization - graph theory - integer programming - polyhedral combinatorics - polynomial-time algorithms

Related subjects » Applications - Computational Science & Engineering - Theoretical Computer Science

Table of contents / Sample pages 

Popular Content within this publication 



Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Operations Research, Mathematical Programming.

Additional information