Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation.
Pedro M. CastroPublished in: Optim. Methods Softw. (2017)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- test problems
- np hard
- optimal solution
- combinatorial optimization
- precedence constraints
- upper bounding
- search tree
- lagrangian relaxation
- single machine scheduling problem
- lower bounding
- randomly generated problems
- mixed integer linear programming
- variable ordering
- max sat
- finding an optimal solution
- maximum clique
- branch and bound method
- search algorithm
- computational complexity
- neural network
- integer variables
- nearest neighbor