The following pages link to (Q4350078):
Displaying 12 items.
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Parallel local search (Q1922627) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- The Shape of a Local Minimum and the Probability of its Detection in Random Search (Q3564527) (← links)
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem (Q3625007) (← links)
- AN OPTIMAL DISTRIBUTION OF SEARCHING EFFORT RELAXING THE ASSUMPTION OF LOCAL EFFECTIVENESS (Q4483729) (← links)
- Stochastic Algorithms: Foundations and Applications (Q5901978) (← links)
