Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
gptkb:traveling_salesman_problem
gptkb:knapsack_problem gptkb:NP-hard_problems gptkb:integer_linear_programming |
| gptkbp:developedBy |
1960s
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:firstPublished |
1960
|
| gptkbp:hasConcept |
pruning of suboptimal solutions
systematic enumeration of candidate solutions |
| https://www.w3.org/2000/01/rdf-schema#label |
Branch and bound
|
| gptkbp:inventedBy |
Ailsa Land
Alison Doig |
| gptkbp:property |
can be exponential time complexity
guarantees optimal solution solution space partitioning tree search method uses upper and lower bounds |
| gptkbp:publishedIn |
gptkb:Econometrica
|
| gptkbp:relatedTo |
dynamic programming
backtracking cutting plane method |
| gptkbp:step |
pruning
branching bounding |
| gptkbp:usedFor |
combinatorial optimization
integer programming global optimization |
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|