A branch and bound algorithm for robust binary optimization with budget uncertainty.
Christina BüsingTimo GersingArie M. C. A. KosterPublished in: Math. Program. Comput. (2023)
Keyphrases
- branch and bound algorithm
- robust optimization
- combinatorial optimization
- lower bound
- branch and bound
- optimal solution
- lower bounding
- upper bound
- test problems
- np hard
- mathematical programming
- mixed integer linear programming
- precedence constraints
- search tree
- single machine scheduling problem
- randomly generated problems
- upper bounding
- lagrangian relaxation
- optimization problems
- finding an optimal solution
- max sat
- optimization algorithm
- branch and bound method
- neural network
- simulated annealing