An improved Lagrangian relaxation and dual ascent approach to facility location problems.
Kurt JörnstenAndreas KlosePublished in: Comput. Manag. Sci. (2016)
Keyphrases
- lagrangian relaxation
- facility location
- facility location problem
- integer programming
- dual variables
- lagrangian dual
- np hard
- branch and bound algorithm
- lower bound
- feasible solution
- column generation
- linear programming
- lower and upper bounds
- dynamic programming
- approximation algorithms
- dual decomposition
- primal dual
- mixed integer programming
- network design problem
- shortest path
- upper bound
- bayesian networks
- valid inequalities
- optimal solution
- branch and bound
- special case
- convex hull
- linear program
- objective function