Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling.
André A. CiréElvin CobanJohn N. HookerPublished in: CPAIOR (2013)
Keyphrases
- mixed integer programming
- benders decomposition
- network design problem
- mixed integer
- production planning
- lot sizing
- valid inequalities
- integer programming
- optimal solution
- linear program
- column generation
- feasible solution
- scheduling problem
- knapsack problem
- cutting plane
- convex hull
- infinite horizon
- heuristic search
- resource allocation
- linear programming
- network design
- branch and bound
- objective function
- simulated annealing
- linear constraints
- lagrangian relaxation
- special case
- evolutionary algorithm