Using Branch-and-Bound with Constraint Satisfaction in Optimization Problems.
Stephen BealePublished in: AAAI/IAAI (1997)
Keyphrases
- branch and bound
- constraint satisfaction
- optimization problems
- combinatorial optimization
- russian doll search
- constraint satisfaction problems
- search space
- lower bound
- metaheuristic
- evolutionary algorithm
- branch and bound algorithm
- search algorithm
- heuristic search
- upper bound
- column generation
- objective function
- optimal solution
- traveling salesman problem
- cost function
- branch and bound procedure
- constraint relaxation
- phase transition
- tree search
- constraint programming
- constraint propagation
- benchmark problems
- branch and bound search
- constrained problems
- soft constraints
- beam search
- sat solvers
- branch and bound method
- depth first search
- lagrangian heuristic
- knapsack problem
- probabilistic reasoning
- mathematical programming
- search strategies
- arc consistency
- vehicle routing problem
- simulated annealing
- robust fault detection
- integer programming
- neural network
- genetic algorithm