Simulated annealing and Tabu search in the long run: A comparison on QAP tasks
- 1 September 1994
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 28 (6) , 1-8
- https://doi.org/10.1016/0898-1221(94)00147-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Epcot: An efficient procedure for coloring optimally with Tabu SearchComputers & Mathematics with Applications, 1993
- Bounding the probability of success of stochastic methods for global optimizationComputers & Mathematics with Applications, 1993
- Parallel biased search for combinatorial optimization: genetic algorithms and TABUMicroprocessors and Microsystems, 1992
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Algorithms for assignment problems on an array processorParallel Computing, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Optimization by Simulated AnnealingScience, 1983
- An Experimental Comparison of Techniques for the Assignment of Facilities to LocationsOperations Research, 1968
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961