Lower Bounding Techniques for DSATUR-based Branch and Bound.
Fabio FuriniVirginie GabrelIan-Christopher TernierPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- lower bounding
- branch and bound
- branch and bound algorithm
- lower bound
- upper bound
- search algorithm
- optimal solution
- column generation
- combinatorial optimization
- lower and upper bounds
- search space
- branch and bound method
- branch and bound procedure
- dynamic time warping
- search strategies
- lagrangian relaxation
- max sat
- linear programming relaxation
- np hard
- search strategy
- multi step
- quadratic assignment problem
- special case
- linear programming