Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem.
Tim CarnesDavid B. ShmoysPublished in: APPROX-RANDOM (2011)
Keyphrases
- lagrangian relaxation
- primal dual
- linear programming
- feasible solution
- linear program
- column generation
- integer programming
- linear programming problems
- np hard
- interior point methods
- mixed integer programming
- dynamic programming
- semidefinite programming
- approximation algorithms
- variational inequalities
- valid inequalities
- lower bound
- convergence rate
- simplex method
- convex optimization
- optimal solution
- objective function
- algorithm for linear programming
- branch and bound algorithm
- saddle point
- quadratic programming
- lower and upper bounds
- vehicle routing problem
- special case
- convex programming
- interior point
- convex optimization problems
- dual formulation
- mixed integer
- cutting plane
- search algorithm
- set covering problem
- learning algorithm