optimization
Branch and bound
taught
Taught in
-
Branch and bound
Optimization
-
The 0-1 knapsack problem
Optimization
-
Facility location
Optimization
Requires
- integer-programming-rounding-failure required
Required by
- The Bellman equation required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.