Robust taboo search for the quadratic assignment problem
- 1 July 1991
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 17 (4-5) , 443-455
- https://doi.org/10.1016/s0167-8191(05)80147-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Some efficient heuristic methods for the flow shop sequencing problemEuropean Journal of Operational Research, 1990
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search Applied to the Quadratic Assignment ProblemINFORMS Journal on Computing, 1990
- Algorithms for assignment problems on an array processorParallel Computing, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- A thermodynamically motivated simulation procedure for combinatorial optimization problemsEuropean Journal of Operational Research, 1984
- Quadratic assignment problemsEuropean Journal of Operational Research, 1984
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- An Experimental Comparison of Techniques for the Assignment of Facilities to LocationsOperations Research, 1968
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961