Measuring instance difficulty for combinatorial optimization problems (Q1762054)

From MaRDI portal
Revision as of 05:58, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q62033372, #quickstatements; #temporary_batch_1712286835472)
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
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    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