A branch-and-bound algorithm for the continuous facility layout problem.
Wei XieNikolaos V. SahinidisPublished in: Comput. Chem. Eng. (2008)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- search tree
- upper bound
- lower bounding
- randomly generated
- test problems
- np hard
- optimal solution
- combinatorial optimization
- precedence constraints
- upper bounding
- randomly generated problems
- mixed integer linear programming
- single machine scheduling problem
- branch and bound method
- finding an optimal solution
- variable ordering
- search space
- search algorithm
- lagrangian relaxation
- computational complexity