A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors.
Rémy GarciaClaude MichelMichel RueherPublished in: CP (2020)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- np hard
- optimal solution
- test problems
- upper bound
- precedence constraints
- lower bounding
- combinatorial optimization
- single machine scheduling problem
- search tree
- upper bounding
- mixed integer linear programming
- randomly generated problems
- branch and bound method
- finding an optimal solution
- variable ordering
- lagrangian relaxation
- search algorithm
- genetic algorithm
- max sat
- scheduling problem
- special case
- integer variables
- neural network