Branch and bound
Ramificación y poda
- Date
- 1960 · confidence high
- Place
- London, England, United Kingdom
- Credited to
- Alison Harcourt y Ailsa Land
- Field
- Knowledge & symbols
What it is
Ailsa Land and Alison Doig devised branch and bound, which solves optimization problems by exploring a tree of candidate solutions and discarding branches that cannot beat the best one found so far.
What it led to
- Practical solving of integer programming
- Commercial optimization solvers
- Route and schedule planning
- Extension to constraint programming