A branch and bound algorithm for the generalized assignment problem.
G. Terry RossRichard M. SolandPublished in: Math. Program. (1975)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- optimal solution
- test problems
- upper bound
- np hard
- combinatorial optimization
- search tree
- single machine scheduling problem
- lower bounding
- upper bounding
- mixed integer linear programming
- randomly generated problems
- precedence constraints
- search algorithm
- finding an optimal solution
- variable ordering
- max sat
- lagrangian relaxation
- branch and bound method
- maximum clique
- column generation
- search space