Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming.
Vianney CoppéXavier GillardPierre SchausPublished in: CP (2023)
Keyphrases
- branch and bound
- combinatorial optimization
- dynamic programming
- mini bucket
- integer programming problems
- branch and bound algorithm
- search algorithm
- lower bound
- implicit enumeration
- branch and bound search
- column generation
- search space
- bnb adopt
- upper bound
- optimal solution
- decision diagrams
- lagrangian relaxation
- tree search
- efficient computation
- branch and bound procedure
- branch and bound method
- optimization problems
- simulated annealing
- lagrangian heuristic
- markov decision processes
- multi valued decision diagrams
- network design problem
- metaheuristic
- compressed data
- state space
- cost function
- previously solved
- evolutionary algorithm
- learning algorithm