On metaheuristic algorithms for combinatorial optimization problems
- 1 March 2001
- journal article
- research article
- Published by Wiley in Systems and Computers in Japan
- Vol. 32 (3), 33-55
- https://doi.org/10.1002/1520-684x(200103)32:3<33::aid-scj4>3.0.co;2-p
Abstract
No abstract availableKeywords
This publication has 102 references indexed in Scilit:
- Linear analysis of genetic algorithmsTheoretical Computer Science, 1998
- TSP ejection chainsDiscrete Applied Mathematics, 1997
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problemOperations Research Letters, 1997
- Local search with memory: benchmarking RTSOR Spectrum, 1995
- Strategies with memories: local search in an application oriented environmentOR Spectrum, 1995
- Data Structures for Traveling SalesmenJournal of Algorithms, 1995
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- On the Approximation of Maximum SatisfiabilityJournal of Algorithms, 1994
- A user's guide to tabu searchAnnals of Operations Research, 1993
- Optimization by Simulated AnnealingScience, 1983