Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm.
Alexandre GoldsztejnYahia LebbahClaude MichelMichel RueherPublished in: CP (2008)
Keyphrases
- upper bounding
- branch and bound algorithm
- upper bound
- lower bounding
- lower bound
- branch and bound
- optimal solution
- np hard
- combinatorial optimization
- linear programming relaxation
- lagrangian relaxation
- single machine scheduling problem
- search algorithm
- constraint satisfaction
- special case
- column generation
- lower and upper bounds
- search space
- feature space