Skip to content

Integer and Combinatorial Optimization

H. P. Williams, George L. Nemhauser, Laurence A. Wolsey

Journal of the Operational Research Society · 1990 · 5,532 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990). Integer and combinatorial optimization. Journal of the Operational Research Society, 41(2), 177. https://doi.org/10.1057/jors.1990.26

In text: (Williams et al., 1990)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Combinatorial Optimization: Algorithms and Complexity.1984
  2. The quickhull algorithm for convex hulls1996
  3. Voronoi diagrams—a survey of a fundamental geometric data structure1991
  4. The Nucleolus of a Characteristic Function Game1969

Metadata from OpenAlex (CC0). Citations are generated from the published record.