Integer and Combinatorial OptimizationISBN: 978-0-471-35943-2
Paperback
784 pages
July 1999
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
FOUNDATIONS.
The Scope of Integer and Combinatorial Optimization.
Linear Programming.
Graphs and Networks.
Polyhedral Theory.
Computational Complexity.
Polynomial-Time Algorithms for Linear Programming.
Integer Lattices.
GENERAL INTEGER PROGRAMMING.
The Theory of Valid Inequalities.
Strong Valid Inequalities and Facets for Structured Integer Programs.
Duality and Relaxation.
General Algorithms.
Special-Purpose Algorithms.
Applications of Special- Purpose Algorithms.
COMBINATORIAL OPTIMIZATION.
Integral Polyhedra.
Matching.
Matroid and Submodular Function Optimization.
References.
Indexes.
The Scope of Integer and Combinatorial Optimization.
Linear Programming.
Graphs and Networks.
Polyhedral Theory.
Computational Complexity.
Polynomial-Time Algorithms for Linear Programming.
Integer Lattices.
GENERAL INTEGER PROGRAMMING.
The Theory of Valid Inequalities.
Strong Valid Inequalities and Facets for Structured Integer Programs.
Duality and Relaxation.
General Algorithms.
Special-Purpose Algorithms.
Applications of Special- Purpose Algorithms.
COMBINATORIAL OPTIMIZATION.
Integral Polyhedra.
Matching.
Matroid and Submodular Function Optimization.
References.
Indexes.
Related Titles
More From This Series
Discrete Mathematics
Read Online Now at Wiley Online Library
An online version of this product is available through our
subscription-based content service.
Read Online
View the Series
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
