Abstract

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.

Keywords

Integer programmingCombinatorial optimizationInteger (computer science)Computer scienceScheduling (production processes)Project managementOperations researchMathematical optimizationMathematicsEngineeringSystems engineeringProgramming language

Affiliated Institutions

Related Publications

On Finding Primal- and Dual-Optimal Bases

Nimrod Megiddo

We show that if there exists a strongly polynomial time algorithm that finds a basis which is optimal for both the primal and the dual problems, given an optimal solution for on...

1991 INFORMS Journal on Computing 101 citations

Publication Info

Year
1990
Type
article
Volume
41
Issue
2
Pages
177-177
Citations
5548
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

5548
OpenAlex

Cite This

H. P. Williams, George L. Nemhauser, Laurence A. Wolsey (1990). Integer and Combinatorial Optimization. Journal of the Operational Research Society , 41 (2) , 177-177. https://doi.org/10.2307/2583737

Identifiers

DOI
10.2307/2583737