Solving the anti-covering location problem using Lagrangian relaxation.
Alan T. MurrayRichard L. ChurchPublished in: Comput. Oper. Res. (1997)
Keyphrases
- lagrangian relaxation
- subgradient method
- mixed integer program
- integer programming
- lower bound
- lagrangian dual
- np hard
- column generation
- branch and bound algorithm
- feasible solution
- linear programming
- branch and bound search
- lagrangian heuristic
- lower and upper bounds
- dual decomposition
- dynamic programming
- relaxation algorithm
- capacity constraints
- linear programming problems
- optimization problems
- dual variables
- combinatorial optimization
- cutting plane algorithm
- special case
- integer program
- network design problem
- genetic algorithm
- multi objective
- single machine scheduling problem
- valid inequalities
- shortest path
- neural network
- tabu search
- linear program