×

Massively parallel tabu search for the quadratic assignment problem. (English) Zbl 0775.90288


MSC:

90C27 Combinatorial optimization
90C20 Quadratic programming
65Y05 Parallel numerical computation
90C09 Boolean programming
90-08 Computational methods for problems pertaining to operations research and mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] J. Chakrapani and J. Skorin-Kapov, A connectionist approach to the quadratic assignment problem, J. Comp. Oper. Res. 19(1992)287–295. · Zbl 0757.90060 · doi:10.1016/0305-0548(92)90050-F
[2] B. Gavish, Manifold search techniques applied to the quadratic assignment problem, Technical report, Owen Graduate School of Management, Vanderbilt University (1991).
[3] A. Geoffrion and G. Graves, Scheduling parallel production lines with changeover costs: Practical applications of a quadratic assignment/linear programming approach, Oper. Res. 24(1976)595–610. · Zbl 0341.90030 · doi:10.1287/opre.24.4.595
[4] F. Glover, Candidate list strategies and tabu search, Technical report, Center for Applied Artificial Intelligence, University of Colorado, Boulder (1989).
[5] F. Glover, Tabu search. Part I, ORSA J. Comput. 1(1989)190–206.
[6] F. Glover, Tabu search. Part II, ORSA J. Comput. 2(1990)4–32.
[7] F. Glover and R. Hübscher, Bin packing with tabu search, Technical report, Center for Applied Artificial Intelligence, University of Colorado, Boulder (1991).
[8] W.D. Hillis,The Connection Machine (The MIT Press, 1985).
[9] J. Kelly, M. Laguna and F. Glover, A study of diversification strategies for the quadratic assignment problem, Technical report, Graduate School of Business and Administration, University of Colorado, Boulder (1991). · Zbl 0814.90060
[10] U. Manber,Introduction to Algorithms (Addison-Wesley, 1989). · Zbl 0825.68397
[11] C. Nugent, T. Volmann and J. Ruml, An experimental comparison of techniques for the assignment of facilities to locations, Oper. Res. 16(1968)150–173. · doi:10.1287/opre.16.1.150
[12] S. Sahni and T. Gonzalez, P-complete approximation problems, J. ACM 23(1976)555–565. · Zbl 0348.90152 · doi:10.1145/321958.321975
[13] J. Skorin-Kapov, Extensions of a tabu search adaptation to the quadratic assignment problem, J. Comp. Oper. Res., to appear. · Zbl 0812.90098
[14] J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1990)33–45. · Zbl 0752.90054
[15] L. Steinberg, The backboard wiring problem: A placement algorithm, SIAM Rev. 3(1961)37–50. · Zbl 0097.14703 · doi:10.1137/1003003
[16] E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comput. 17(1991)443–455. · doi:10.1016/S0167-8191(05)80147-4
[17] Thinking Machines Corporation, Cambridge, MA, Connection Machine Model CM-2, Technical Summary Version 5.1. (May 1989).
[18] Thinking Machines Corporation, Cambridge, MA, C* Programming Guide, Version 6.0. (November 1990).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.