Lagrangean duals and exact solution to the capacitated p-center problem.
Maria Albareda-SambolaJuan A. DíazElena FernándezPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- exact solution
- network design problem
- column generation
- lower bound
- lagrangean relaxation
- facility location problem
- np hard
- linear programming
- optimal solution
- exact algorithms
- branch and bound
- facility location
- linear program
- approximate solutions
- mixed integer programming
- lagrangian relaxation
- numerical solution
- integer programming
- upper bound
- approximation algorithms
- multi item
- multi source
- computationally challenging
- set covering problem
- lot sizing
- single source
- constraint programming
- integer linear programming
- feasible solution
- worst case
- capacity constraints
- minimal cost
- network design
- routing problem
- vehicle routing problem