Combinatorial Optimization

Name: Combinatorial Optimization
Author: Alexander Schrijver

Polyhedra and Efficiency

Gebonden Engels 2002 2003e druk 9783540443896

168,99

In winkelwagen

Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783540443896

Taal:Engels

Bindwijze:gebonden

Aantal pagina's:1881

Uitgever:Springer Berlin Heidelberg

Druk:2003

Hoofdrubriek:Inkoop en logistiek, Inkoop en logistiek

Serie:Algorithms and Combinatorics

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Schrijf een recensie

Uw cijfer

?

Log in om te stemmen

Inhoudsopgave

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.