An Automatic Method of Solving Discrete Programming Problems.

Land, A. H., & Doig, A. G. (1960). An Automatic Method of Solving Discrete Programming Problems. Econometrica, 28(3), 497-520.

Type

Journal article

Intellectual base

Primary research

Year

1960

DOI

10.2307/1910129

Link

https://doi.org/10.2307/1910129

Cited from

cognitive_science, computer_science, operations_research

Cited by

4 citations across 4 artifacts.

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

Primes

• Backtracking
  • Branch-and-bound is backtracking plus bounding.
• Branch and Bound
  • Branch and bound originates with

    This sourcethe original branch-and-bound paper, formalizing implicit enumeration via partition-and-bound for (mixed-)integer linear programming.

• Integer Linear Programming (ILP)
  • Land and Doig (1960) formalized branch-and-bound.

    This sourceFoundational branch-and-bound paper formalizing implicit enumeration through partition-and-bound for integer linear programming; widely credited as the original B&B publication in operations research.

• Navigation
  • And decision-tree pruning, the reasoning behind branch-and-bound, transferred to focused literature review, where the cost-of-traversal calculation becomes a reading-time budget over which citations to follow.

    This sourceIntroduces branch-and-bound — the cost-of-traversal pruning of a decision tree — the reasoning that transfers to focused, budget-bounded exploration.

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:b94e7984e933 · see in the full table