On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autocorrelation coefficient for the graph bipartitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the landscape ruggedness of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quality of local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem and local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search and the local structure of NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooling Schedules for Optimal Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the depth of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The depth and width of local minima in discrete solution spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes and their correlation functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlated and uncorrelated fitness landscapes and how to tell the difference / rank
 
Normal rank

Latest revision as of 11:29, 29 May 2024

scientific article
Language Label Description Also known as
English
On the classification of NP-complete problems in terms of their correlation coefficient
scientific article

    Statements

    On the classification of NP-complete problems in terms of their correlation coefficient (English)
    0 references
    0 references
    3 July 2002
    0 references
    local search
    0 references
    meta-heuristics
    0 references
    autocorrelation coefficient
    0 references
    classification of combinatorial optimization
    0 references
    problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references