Branch and Bound for Facility Layout Problem Using Minimum Weighted Clique Problem in Complete K-partite Graph.
Lakehal SoumayaAitzai AbdelhakimPublished in: ICRAI (2017)
Keyphrases
- branch and bound
- branch and bound algorithm
- lower bound
- search algorithm
- upper bound
- search space
- combinatorial optimization
- optimal solution
- column generation
- branch and bound procedure
- tree search
- randomly generated problems
- lagrangian heuristic
- maximum weight
- branch and bound method
- mixed integer programming
- beam search
- depth first search
- branch and bound search
- partial solutions
- linear programming relaxation
- network design problem
- tree search algorithm
- max sat
- cost function
- sat problem
- weighted graph
- state space