UID:
almahu_9948621281902882
Umfang:
X, 214 p.
,
online resource.
Ausgabe:
1st ed. 2003.
ISBN:
9783540364788
Serie:
Lecture Notes in Computer Science, 2570
Anmerkung:
"Eureka - You Skrink!" -- "Eureka - You Shrink!" -- Submodular Functions, Matroids, and Certain Polyhedra -- Matching: A Well-Solved Class of Integer Linear Programs -- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems -- Connected Matchings -- Hajós' Construction and Polytopes -- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection -- Solving Real-World ATSP Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem -- Reconstructing a Simple Polytope from Its Graph -- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming -- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope -- Constructing New Facets of the Consecutive Ones Polytope -- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming -- Mixed-Integer Value Functions in Stochastic Programming -- Exact Algorithms for NP-Hard Problems: A Survey.
In:
Springer Nature eBook
Weitere Ausg.:
Printed edition: ISBN 9783662196991
Weitere Ausg.:
Printed edition: ISBN 9783540005803
Sprache:
Englisch
DOI:
10.1007/3-540-36478-1
URL:
https://doi.org/10.1007/3-540-36478-1
