Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation.
Yves CaseauFrançois LaburthePublished in: Combinatorics and Computer Science (1995)
Keyphrases
- constraint propagation
- branch and bound
- search space
- tree search
- branch and bound algorithm
- search algorithm
- lower bound
- constraint satisfaction problems
- constraint programming
- upper bound
- optimal solution
- column generation
- constraint satisfaction
- temporal constraints
- combinatorial optimization
- beam search
- arc consistency
- search strategies
- branch and bound method
- scheduling problem
- heuristic search
- linear programming
- max sat
- lagrangian heuristic
- constrained problems
- tree decomposition
- branch and bound procedure
- search strategy
- search tree
- tabu search
- probabilistic model
- bnb adopt
- dynamic programming