On the linear relaxation of the p-median problem.
Mourad BaïouFrancisco BarahonaPublished in: Discret. Optim. (2011)
Keyphrases
- linear relaxation
- linear program
- minimum cost
- linear constraints
- set partitioning
- column generation
- relaxation algorithm
- valid inequalities
- knapsack problem
- constant factor
- soft constraints
- random graphs
- linear programming
- integer programming
- np hard
- integer program
- mixed integer programming
- shortest path
- lower bound
- cutting plane
- linear programming relaxation
- relaxation labeling
- continuous variables
- branch and bound
- traveling salesman problem
- convex hull