Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem.
D. Benjamin GordonStephen L. MayoPublished in: J. Comput. Chem. (1998)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- optimization problems
- metaheuristic
- traveling salesman problem
- branch and bound
- dead end
- combinatorial problems
- simulated annealing
- graph theory
- hard combinatorial optimization problems
- mathematical programming
- branch and bound algorithm
- exact algorithms
- neural network
- quadratic assignment problem
- elimination algorithm
- knapsack problem
- max flow min cut