Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808)

From MaRDI portal
Revision as of 10:52, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Analyzing the complexity of finding good neighborhood functions for local search algorithms
scientific article

    Statements

    Analyzing the complexity of finding good neighborhood functions for local search algorithms (English)
    0 references
    0 references
    0 references
    5 January 2007
    0 references
    Computational complexity
    0 references
    Local search algorithms
    0 references
    NP-hard discrete optimization problems
    0 references

    Identifiers

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