On the set partitioning type formulation for the discrete location problem.
John DarzentasP. BairaktarisPublished in: Comput. Oper. Res. (1986)
Keyphrases
- set partitioning
- column generation
- integer programming
- dantzig wolfe decomposition
- vehicle routing
- vehicle routing problem with time windows
- routing problem
- linear programming relaxation
- branch and bound
- problems involving
- constraint programming
- linear program
- linear programming
- lagrangian relaxation
- global optimization
- optimal solution
- lp relaxation