Measuring instance difficulty for combinatorial optimization problems (Q1762054): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/cor/Smith-MilesL12, #quickstatements; #temporary_batch_1731543907597 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/cor/Smith-MilesL12 / rank | |||
Normal rank | |||
Revision as of 01:38, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Measuring instance difficulty for combinatorial optimization problems |
scientific article |
Statements
Measuring instance difficulty for combinatorial optimization problems (English)
0 references
15 November 2012
0 references
algorithm selection
0 references
combinatorial optimization
0 references
hardness prediction
0 references
instance difficulty
0 references
landscape analysis
0 references
phase transition
0 references
traveling salesman problem
0 references
assignment problem
0 references
knapsack problem
0 references
bin-packing
0 references
graph coloring
0 references
timetabling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
