Measuring instance difficulty for combinatorial optimization problems.
Kate Smith-MilesLeo LopesPublished in: Comput. Oper. Res. (2012)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- optimization problems
- metaheuristic
- ant colony optimization
- discrete optimization
- job shop scheduling
- shortest path problem
- traveling salesman problem
- continuous optimization problems
- vehicle routing problem
- job shop scheduling problem
- objective function
- min cost
- special case
- evolutionary algorithm
- learning algorithm
- aco algorithms
- machine learning