Branch-and-bound methods

Lawler, E. L., & Wood, D. E. (1966). Branch-and-bound methods: A survey. Operations Research, 14(4), 699-719.

Type

Journal article

Intellectual base

Primary research

Year

1966

Volume

14

Issue

4

Pages

699-719

DOI

10.1287/opre.14.4.699

DOI registrant

Institute for Operations Research and the Management Sciences

Link

https://doi.org/10.1287/opre.14.4.699

Cited from

operations_research

Cited by

1 citation across 1 artifact.

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

Primes

• Branch and Bound
  • for TSP in "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems" SIAM Review 33:60-100; Lawler and Wood (1966)

    This sourceearly comprehensive survey abstracting branch-and-bound into a general algorithmic framework (bounding/branching/pruning) rather than a problem-specific procedure.

    Supported in partVerified against the publisher's abstract

    Lawler & Wood's abstract confirms an early general branch-and-bound survey covering integer programming, but says nothing of mixed-integer programming, cutting planes or branch-and-cut.

    “The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed. These include integer linear programming (Land-Doig and Balas methods), nonlinear programming (minimization of nonconvex objective functions), the traveling-salesman problem (Eastman and Little, et al. methods), and the quadratic assignment problem (Gilmore and Lawler …”

    Read by an automated reader; not a human review. How support was checked

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:53d43fe93d7d · see in the full table