You are here

Integer and Combinatorial Optimization

Publisher: 
John Wiley
Number of Pages: 
763
Price: 
110.00
ISBN: 
0471359432
Date Received: 
Saturday, January 1, 2000
Reviewable: 
No
Include In BLL Rating: 
Yes
Reviewer Email Address: 
George L. Nemharuser and Laurence A. Wolsey
Publication Date: 
1999
Format: 
Paperback
Category: 
General

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.

Publish Book: 
Modify Date: 
Sunday, July 6, 2008

Dummy View - NOT TO BE DELETED