Data-independent neighborhood functions and strict local optima

DOI10.1016/j.dam.2004.09.007zbMath1077.90053OpenAlexW2123512308MaRDI QIDQ1763477

Derek E. Armstrong, Jacobson, Sheldon H.

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.09.007

zbMATH Keywords

Computational complexityExponential neighborhoodLocal search algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Polynomial transformations and data-independent neighborhood functions ⋮ An analysis of neighborhood functions on generic solution spaces ⋮ Order preserving reductions and polynomial improving paths

Cites Work

• A survey of very large-scale neighborhood search techniques
• How easy is local search?
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
• Polynomial transformations and data-independent neighborhood functions
• Hill Climbing with Multiple Local Optima
• Multiple optima in local search
• Some Examples of Difficult Traveling Salesman Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Data-independent neighborhood functions and strict local optima