An analysis of neighborhood functions on generic solution spaces
From MaRDI portal
Publication:2462147
DOI10.1016/j.ejor.2007.01.043zbMath1138.90431OpenAlexW2094249576MaRDI QIDQ2462147
Derek E. Armstrong, Jacobson, Sheldon H.
Publication date: 23 November 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.043
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Performance analysis of cyclical simulated annealing algorithms
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
- How easy is local search?
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
- Studying the complexity of global verification for NP-hard discrete optimization problems
- Data-independent neighborhood functions and strict local optima
- On the classification of NP-complete problems in terms of their correlation coefficient
- Order preserving reductions and polynomial improving paths
- Hill Climbing with Multiple Local Optima
- Multiple optima in local search
- The effectiveness of finite improvement algorithms for finding global optima
- Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results
