The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm.
Jeffery L. KenningtonFarin MohammadiPublished in: Comput. Optim. Appl. (1994)
Keyphrases
- lagrangian relaxation
- np hard
- integer programming
- branch and bound algorithm
- feasible solution
- lower bound
- linear programming
- column generation
- lower and upper bounds
- dynamic programming
- capacity constraints
- lagrangian heuristic
- relaxation algorithm
- dual decomposition
- network design problem
- single machine scheduling problem
- optimal solution
- shortest path
- mixed integer programming
- np complete
- mixed integer program
- subgradient method
- branch and bound
- special case
- search space
- high dimensional
- computational complexity
- search algorithm
- constraint programming
- mixed integer linear programs