An integer-programming-based heuristic for the balanced loading problem.
Kamlesh MathurPublished in: Oper. Res. Lett. (1998)
Keyphrases
- integer programming
- lagrangian relaxation
- set covering
- packing problem
- set covering problem
- linear programming relaxation
- linear programming
- np hard
- integer programming formulations
- constraint programming
- column generation
- facility location
- production planning
- cutting plane
- ai planning
- cutting plane algorithm
- network flow
- exact methods
- dynamic programming
- inference problems
- valid inequalities
- optimal solution
- vehicle routing problem with time windows
- dantzig wolfe decomposition
- set partitioning
- integer program
- search algorithm
- lp relaxation
- transportation problem
- mixed integer programming
- running times
- reinforcement learning
- special case
- constraint satisfaction
- heuristic methods
- linear program
- combinatorial optimization
- search strategies
- approximation algorithms