Zur Startseite gehen
0,00 €*
Cover: 9783540443896 | Combinatorial Optimization | Polyhedra and Efficiency | Schrijver
Dekorationsartikel gehören nicht zum Leistungsumfang.
Combinatorial Optimization
Polyhedra and Efficiency
Buch von Alexander Schrijver
Sprache: Englisch

143,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
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.
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.
Über den Autor

Alexander Schrijver is one of the most respected researchers in this area. He has won the Dantzig award, the Fulkerson prize (twice) and the Lanchester Prize for his earlier classic text on "Theory of Linear and Integer Programming".

Zusammenfassung

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.

Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2002
Fachbereich: Wahrscheinlichkeitstheorie
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Algorithms and Combinatorics
Inhalt: 3 Bücher
ISBN-13: 9783540443896
ISBN-10: 3540443894
Sprache: Englisch
Herstellernummer: 10874786
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Schrijver, Alexander
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Algorithms and Combinatorics
Maße: 241 x 160 x 123 mm
Von/Mit: Alexander Schrijver
Erscheinungsdatum: 10.12.2002
Gewicht: 3,451 kg
Artikel-ID: 102576404
Über den Autor

Alexander Schrijver is one of the most respected researchers in this area. He has won the Dantzig award, the Fulkerson prize (twice) and the Lanchester Prize for his earlier classic text on "Theory of Linear and Integer Programming".

Zusammenfassung

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.

Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2002
Fachbereich: Wahrscheinlichkeitstheorie
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Algorithms and Combinatorics
Inhalt: 3 Bücher
ISBN-13: 9783540443896
ISBN-10: 3540443894
Sprache: Englisch
Herstellernummer: 10874786
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Schrijver, Alexander
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Algorithms and Combinatorics
Maße: 241 x 160 x 123 mm
Von/Mit: Alexander Schrijver
Erscheinungsdatum: 10.12.2002
Gewicht: 3,451 kg
Artikel-ID: 102576404
Warnhinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...