scientific article; zbMATH DE number 1054958
From MaRDI portal
Publication:4350078
Recommendations
- Principles of Stochastic Local Search
- scientific article; zbMATH DE number 1256747
- Statistical analysis of local search landscapes
- Analyzing randomized search heuristics: tools from probability theory
- scientific article; zbMATH DE number 18531
- On a randomized version of exhaustive local search
- Using Markov chains to analyze the effectiveness of local search algorithms
- scientific article; zbMATH DE number 5159135
- scientific article; zbMATH DE number 2226659
Cited in
(16)- TTT plots: a perl program to create time-to-target plots
- The Shape of a Local Minimum and the Probability of its Detection in Random Search
- Using Markov chains to analyze the effectiveness of local search algorithms
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Metaheuristics: A bibliography
- Stochastic Algorithms: Foundations and Applications
- A framework for analyzing sub-optimal performance of local search algorithms
- An experimental analysis of local minima to improve neighbourhood search.
- Parallel local search
- AN OPTIMAL DISTRIBUTION OF SEARCHING EFFORT RELAXING THE ASSUMPTION OF LOCAL EFFECTIVENESS
- Smoothed analysis of the 2-Opt algorithm for the general TSP
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract)
- Visiting near-optimal solutions using local search algorithms
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- The simultaneous semi-random model for TSP
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350078)
