A branch-and-bound algorithm for the singly constrained assignment problem.
P. M. D. LieshoutA. VolgenantPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- np hard
- lower bound
- branch and bound
- randomly generated
- optimal solution
- test problems
- combinatorial optimization
- upper bound
- lower bounding
- search tree
- single machine scheduling problem
- precedence constraints
- upper bounding
- randomly generated problems
- mixed integer linear programming
- lagrangian relaxation
- maximum clique
- max sat
- variable ordering
- linear programming
- branch and bound method
- special case
- objective function
- approximation algorithms
- np complete