Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-006-9007-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068598433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial transformations and data-independent neighborhood functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studying the complexity of global verification for NP-hard discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solution of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search, reducibility and approximability of NP-optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation scheme preserving reducibility and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of finite improvement algorithms for finding global optima / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of unconstrained hyperbolic 0--1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple optima in local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252434 / rank
 
Normal rank

Latest revision as of 10:52, 25 June 2024

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