Measuring instance difficulty for combinatorial optimization problems (Q1762054)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6107520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Measuring instance difficulty for combinatorial optimization problems |
scientific article; zbMATH DE number 6107520 |
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
0 references
0 references
0.7989975214004517
0 references
0.7781065702438354
0 references
0.7544043660163879
0 references
0.738701343536377
0 references
0.7355683445930481
0 references
