You are here

Integer and Combinatorial Optimization

George L. Nemharuser and Laurence A. Wolsey
Publisher: 
John Wiley
Publication Date: 
1999
Number of Pages: 
763
Format: 
Paperback
Price: 
110.00
ISBN: 
0471359432
Category: 
General
We do not plan to review this book.

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.

Dummy View - NOT TO BE DELETED