A branch-and-bound algorithm for the single-row equidistant facility layout problem.
Gintaras PalubeckisPublished in: OR Spectr. (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- randomly generated
- search tree
- precedence constraints
- test problems
- np hard
- randomly generated problems
- lagrangian relaxation
- lower bounding
- upper bounding
- mixed integer linear programming
- single machine scheduling problem
- max sat
- finding an optimal solution
- variable ordering
- mixed integer programming
- objective function
- combinatorial optimization
- linear programming
- computational complexity
- linear program