Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm.
Maghsud SolimanpurAmir JafariPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- branch and bound algorithm
- optimal solution
- branch and bound
- lower bound
- np hard
- precedence constraints
- test problems
- lower bounding
- knapsack problem
- linear programming
- mixed integer programming
- lagrangian relaxation
- branch and bound method
- solution quality
- search space
- randomly generated problems
- mixed integer linear programming
- metaheuristic
- upper bound
- finding an optimal solution
- objective function
- total cost
- column generation
- single machine scheduling problem
- layout design
- upper bounding
- mixed integer
- variable ordering
- maximum clique
- max sat
- linear program
- combinatorial optimization
- hybrid algorithm
- special case
- integer variables
- multi objective