Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance.
Deniz NadirlerEsra Köktener KarasakalPublished in: J. Oper. Res. Soc. (2008)
Keyphrases
- single facility
- mixed integer programming
- location problems
- column generation
- lot sizing
- mixed integer
- production planning
- lagrangian relaxation
- dantzig wolfe decomposition
- network design problem
- upper bound
- linear programming
- integer programming
- branch and bound
- integer linear programming
- branch and bound algorithm
- bicriteria
- np hard
- search space
- computational complexity