A New Lagrangian Relaxation Based Algorithm for a Class of Multidimensional Assignment Problems.
Aubrey B. PooreAlexander J. Robertson IIIPublished in: Comput. Optim. Appl. (1997)
Keyphrases
- lagrangian relaxation
- np hard
- dynamic programming
- learning algorithm
- lower and upper bounds
- cost function
- probabilistic model
- relaxation algorithm
- search space
- single machine scheduling problem
- linear programming
- mathematical model
- linear program
- column generation
- dual decomposition
- cutting plane
- constrained optimization
- branch and bound algorithm
- particle swarm optimization
- simulated annealing
- lower bound
- search algorithm