Branch and bound
Pairings in the atlas
- Fractional relaxation boundcanonThe 0/1 knapsackfull lesson ▸backtracking-cp
- Linear programming relaxation boundcanonInteger programmingbacktracking-cp
- Lagrangian relaxation boundstandardCombinatorial optimizationbacktracking-cp
- Best-first node selectionstandardCombinatorial optimizationbacktracking-cp
- Depth-first node selectionstandardMemory-lean optimizationbacktracking-cp
- 1-tree boundstandardTraveling-salesman problembacktracking-cp
- Reduced-cost matrix boundspecialistAsymmetric TSPbacktracking-cp
Rivals: other methods for the same problems
- 0/1 knapsack DP
- 2-opt
- 3-opt
- Active-set method
- Ant Colony System
- Benders decomposition
- Bitmask DP
- Branch and cut
- Branch and price
- Christofides
- Concorde branch and cut
- Cutting-plane method
- Dantzig-Wolfe decomposition
- Double-tree TSP
- Genetic algorithm
- Greedy edge tour
- Held-Karp
- Held-Karp lower bound
- Intelligent water drops
- Knapsack greedy
- Lagrangian relaxation
- Lin-Kernighan
- Lin-Kernighan-Helsgaun
- Nearest neighbor tour