A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization.
Christoph BuchheimPublished in: Discret. Appl. Math. (2020)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- optimization problems
- traveling salesman problem
- branch and bound algorithm
- simulated annealing
- combinatorial problems
- computationally efficient
- metaheuristic
- graph theory
- exact algorithms
- mathematical programming
- branch and bound
- search algorithm
- computational complexity
- quadratic assignment problem
- vehicle routing problem
- discrete optimization
- genetic algorithm
- linear programming
- markov random field
- evolutionary algorithm
- optimal solution
- database
- path relinking