Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization.
J. Michael SteeleTimothy Law SnyderPublished in: SIAM J. Comput. (1989)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- optimization problems
- combinatorial problems
- mathematical programming
- worst case
- metaheuristic
- simulated annealing
- traveling salesman problem
- branch and bound
- exact algorithms
- branch and bound algorithm
- max flow min cut
- hard combinatorial optimization problems
- path relinking
- evolutionary algorithm
- quadratic assignment problem
- search space
- combinatorial search
- cost function
- average case
- problems in computer vision
- submodular functions
- semi definite programming
- lower bound
- search algorithm