Branch-and-bound algorithm for the maximum triangle packing problem.
Youcef AbdelsadekFrancine HerrmannImed KacemBenoît OtjacquesPublished in: Comput. Ind. Eng. (2015)
Keyphrases
- branch and bound algorithm
- packing problem
- lower bound
- np hard
- branch and bound
- integer programming
- upper bound
- optimal solution
- lower bounding
- search tree
- combinatorial optimization
- mixed integer linear programming
- precedence constraints
- randomly generated problems
- upper bounding
- arbitrary shaped
- variable ordering
- lagrangian relaxation
- single machine scheduling problem
- max sat
- branch and bound method
- maximum clique
- integer variables
- neural network
- linear programming
- finding an optimal solution