Journal article

Measuring instance difficulty for combinatorial optimization problems

Kate Smith-Miles, Leo Lopes

Computers & Operations Research | PERGAMON-ELSEVIER SCIENCE LTD | Published : 2012

DOI: 10.1016/j.cor.2011.07.006

University of Melbourne Researchers

Citation metrics

83Web of Science
107Scopus

Keywords

Phase Transition
Engineering, Industrial
Assignment Problem
Complexity
Bin-Packing
Timetabling
Graph Coloring
Performance
Instance Difficulty
Hardness Prediction
Traveling Salesman Problem
Operations Research & Management Science
Computer Science
Hardness
Fitness Landscape Analysis
Algorithm Selection
Local Search
Phase-Transitions
Engineering
Combinatorial Optimization
Landscape Analysis
Science & Technology
Computer Science, Interdisciplinary Applications
Knapsack Problem
Quadratic Assignment Problem
Genetic Algorithms
Technology