Statements (31)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:advantage |
may require large memory
can solve large instances more efficiently than brute force |
| gptkbp:appliesTo |
gptkb:traveling_salesman_problem
gptkb:knapsack_problem mixed integer programming quadratic assignment problem job-shop scheduling |
| gptkbp:category |
exact algorithm
tree search algorithm |
| gptkbp:complexity |
exponential in worst case
|
| gptkbp:developedBy |
1960s
|
| gptkbp:firstPublished |
gptkb:Econometrica
1960 |
| gptkbp:hasConcept |
pruning subproblems using bounds
systematic enumeration of candidate solutions |
| https://www.w3.org/2000/01/rdf-schema#label |
Branch and Bound
|
| gptkbp:inventedBy |
Ailsa Land
Alison Doig |
| gptkbp:relatedTo |
dynamic programming
backtracking cutting plane method |
| gptkbp:step |
pruning
branching bounding |
| gptkbp:usedFor |
combinatorial optimization
integer programming global optimization solving NP-hard problems |
| gptkbp:bfsParent |
gptkb:mathematical_optimization
|
| gptkbp:bfsLayer |
5
|