-Median Problem with a Semi-Lagrangian Relaxation.
Cesar BeltranClaude TadonkiJean-Philippe VialPublished in: Comput. Optim. Appl. (2006)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- np hard
- dynamic programming
- column generation
- linear programming
- lower and upper bounds
- relaxation algorithm
- dual decomposition
- capacity constraints
- mixed integer programming
- mixed integer program
- network design problem
- single machine scheduling problem
- lagrangian heuristic
- shortest path
- upper bound
- subgradient method
- valid inequalities
- scheduling problem
- constrained optimization
- mixed integer
- branch and bound
- combinatorial optimization
- cutting plane
- tabu search
- np complete
- cutting plane algorithm
- evolutionary algorithm
- optimal solution