Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch.
Elif CesurMuhammet Rasit CesurAjith AbrahamPublished in: IEEE Access (2024)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- optimal solution
- lower bounding
- np hard
- upper bound
- worst case
- test problems
- combinatorial optimization
- upper bounding
- lagrangian relaxation
- precedence constraints
- search tree
- randomly generated problems
- max sat
- mixed integer linear programming
- integer programming
- single machine scheduling problem
- finding an optimal solution
- maximum clique
- branch and bound method
- variable ordering
- computational complexity