On the complexity of a class of combinatorial optimization problems with uncertainty.
Igor AverbakhPublished in: Math. Program. (2001)
Keyphrases
- combinatorial optimization problems
- optimization problems
- knapsack problem
- combinatorial optimization
- metaheuristic
- discrete optimization
- ant colony optimization
- traveling salesman problem
- tractable cases
- shortest path problem
- job shop scheduling
- evolutionary algorithm
- continuous optimization problems
- vehicle routing problem
- computational complexity
- exact algorithms
- heuristic search
- constraint satisfaction
- tabu search
- cost function
- uncertain data
- job shop scheduling problem
- machine learning
- neural network