Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62033379, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Chained Lin-Kernighan for Large Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TSP phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical hardness models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objective function features providing barriers to rapid global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: What makes an optimization problem hard?. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes, operators and heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Whether a Problem Characteristic Affects Heuristic Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of metrics on permutations for search landscape analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring instance difficulty for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The landscape of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715669 / rank
 
Normal rank

Latest revision as of 02:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Discovering the suitability of optimisation algorithms by learning from evolved instances
scientific article

    Statements

    Discovering the suitability of optimisation algorithms by learning from evolved instances (English)
    0 references
    0 references
    0 references
    12 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm selection
    0 references
    combinatorial optimization
    0 references
    travelling salesman problem
    0 references
    hardness prediction
    0 references
    phase transition
    0 references
    instance difficulty
    0 references
    0 references
    0 references