A Branch-and-Bound Algorithm for Pagination.
John DuncanLawrence W. ScottPublished in: Oper. Res. (1975)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- np hard
- optimal solution
- test problems
- lower bounding
- single machine scheduling problem
- combinatorial optimization
- search tree
- precedence constraints
- randomly generated problems
- upper bounding
- lagrangian relaxation
- branch and bound method
- mixed integer linear programming
- finding an optimal solution
- search algorithm
- variable ordering
- cost function
- genetic algorithm
- max sat