Integer and Combinatorial Optimization

Nemhauser, G., & Wolsey, L. (1988). Integer and Combinatorial Optimization. Wiley.

Type

Book

Intellectual base

Textbook

Year

1988

DOI

10.1002/9781118627372

ISBN

9780471828198

Link

https://onlinelibrary.wiley.com/doi/book/10.1002/9781118627372

Cited from

operations_research

Cited by

3 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Branch and Bound
  • In operations research, branch-and-bound is the bridge between the theoretical study of combinatorial optimization and its practical realization (formalized in Nemhauser and Wolsey's (1988)

    This sourcecanonical treatise on integer/combinatorial optimization; the standard reference for branch-and-bound theory, polyhedral methods, and relaxation-based bounds.

  • 6

    This sourcetreats the trade-off between bound tightness (stronger relaxations and cutting planes) and the cost of computing those bounds — source for the 'tighter relaxation does not always win' tension.

• Integer Linear Programming (ILP)
  • In polyhedral combinatorics, the study of the integer hull (the convex hull of integer points satisfying the constraints) connects directly to formulation strength; finding tight descriptions of integer hulls for specific problem classes has been a major research program, codified in Nemhauser and Wolsey's (1988) reference work on integer and combinatorial optimization.

    This sourceCanonical comprehensive treatise on integer and combinatorial optimization; the standard reference for branch-and-bound theory, polyhedral methods, and relaxation-based bounds.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:f6c0fdb0f6c8 · see in the full table