A new adaptive multi-start technique for combinatorial global optimizations
- 1 September 1994
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 16 (2) , 101-113
- https://doi.org/10.1016/0167-6377(94)90065-5
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Towards a general theory of adaptive walks on rugged landscapesPublished by Elsevier ,2006
- Best-so-far vs. where-you-are: implications for optimal finite-time annealingSystems & Control Letters, 1994
- Fast Algorithms for Geometric Traveling Salesman ProblemsINFORMS Journal on Computing, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Optimization of Globally Convex FunctionsSIAM Journal on Control and Optimization, 1989
- Ultrametricity, frustration and the graph colouring problemJournal of Physics A: General Physics, 1989
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- A replica analysis of the travelling salesman problemJournal de Physique, 1986
- Configuration space analysis of travelling salesman problemsJournal de Physique, 1985
- Optimization by Simulated AnnealingScience, 1983