Combinatorial Optimization Polyhedra and Efficiency

Name: Combinatorial Optimization Polyhedra and Efficiency
Price: 43.45 USD
Availability: InStock
ISBN: 9783540443896

ISBN-10: 3540443894

ISBN-13: 9783540443896

Edition: 2003

Authors: Alexander Schrijver

List price: $159.99

30 day, 100% satisfaction guarantee!

Sell

Get cash fast!

Marketplace

2 new & used from $43.45

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.

Book details

List price: $159.99
Copyright year: 2003
Publisher: Springer Berlin / Heidelberg
Publication date: 12/10/2002
Binding: Hardcover
Pages: 1879
Size: 6.10" wide x 9.25" long x 5.00" tall
Weight: 8.052
Language: English



Introduction.


Paths and Flows.


Bipartite Matching and Covering.


Nonbipartite Matching and Covering.


Matroids and Submodular Functions.


Trees, Branchings, and Connectors.


Cliques, Stable Sets and Colouring.


Multiflows and Disjoint Paths.


Hypergraphs.


Survey of Problems, Questions and Conjectures.


References.


Name Index.


Subject Index.