articleTop 1% cited

Integer and Combinatorial Optimization

Journal of the Operational Research Society · 1990 · Vol. 41(2) · pp. 177–177

H. P. Williams✉George L. Nemhauser(Georgia Institute of Technology)Laurence A. Wolsey(UCLouvain)

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.

Optimization and Packing ProblemsInteger programmingCombinatorial optimizationInteger (computer science)Computer scienceScheduling (production processes)Project managementOperations researchMathematical optimizationMathematicsEngineering

Citations

5,548

FWCI

179.38

field-weighted impact

References

Percentile

100%

vs. same field & year

Citations per year

Cited by

Branch-and-Price: Column Generation for Solving Huge Integer Programs