{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:03Z","timestamp":1761611163399},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02085649","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T11:22:06Z","timestamp":1124018526000},"page":"387-410","source":"Crossref","is-referenced-by-count":34,"title":["Lower bounds for the quadratic assignment problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Y.","family":"Li","sequence":"first","affiliation":[]},{"given":"P. M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"K. G.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"M. G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02085649_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(85)90025-2","volume":"4","author":"A. Assad","year":"1985","unstructured":"A. Assad and W. Xu, On lower bounds for a class of quadratic {0,1} programs, Oper. Res. Lett. 4(1985)175\u2013180.","journal-title":"Oper. Res. Lett."},{"key":"BF02085649_CR2","first-page":"84","volume":"16","author":"R. Burkard","year":"1973","unstructured":"R. Burkard, Die St\u00f6rungsmethode zur L\u00f6sung quadratischer Zuordnungsprobleme, Oper. Res. Verfahren 16(1973)84\u2013108.","journal-title":"Oper. Res. Verfahren"},{"key":"BF02085649_CR3","volume-title":"Discrete Location Theory","author":"R. Burkard","year":"1990","unstructured":"R. Burkard, Locations with spatial interactions: the quadratic assignment problem, in:Discrete Location Theory, ed. P.B. Mirchandani and R.L. Francis (Wiley, Berlin, 1990) chapter 9."},{"key":"BF02085649_CR4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0377-2217(83)90097-8","volume":"13","author":"R. Burkard","year":"1983","unstructured":"R. Burkard and T. Bonniger, A heuristic for quadratic Boolean programs with applications to quadratic assignment problems, Euro. J. Oper. Res. 13(1983)374\u2013386.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02085649_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R. Burkard","year":"1984","unstructured":"R. Burkard and F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Euro. J. Oper. Res. 17(1984)169\u2013174.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02085649_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/nav.3800250111","volume":"25","author":"R. Burkard","year":"1978","unstructured":"R. Burkard and K. Stratmann, Numerical investigations on quadratic assignment problems, Naval Res. Log. Quarterly 25(1978)129\u2013148.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02085649_CR7","first-page":"B121","volume":"21","author":"R. Burkard","year":"1977","unstructured":"R. Burkard and J. Offerman, Entwurf von Schreibmachinentastaturen mittels quadratischer Zuordnungsprobleme, Z. Oper. Res. 21(1977)B121-B132.","journal-title":"Z. Oper. Res."},{"key":"BF02085649_CR8","doi-asserted-by":"crossref","first-page":"S22","DOI":"10.1287\/opre.40.1.S22","volume":"40","author":"P. Carraresi","year":"1992","unstructured":"P. Carraresi and F. Malucelli, A new lower bound for the quadratic assignment problem. Oper. Res. 40(1992)S22-S27.","journal-title":"Oper. Res."},{"key":"BF02085649_CR9","doi-asserted-by":"crossref","unstructured":"N. Christofides and M. Gerrard, A graph theoretic analysis of bounds for the quadratic assignment problem, in:Studies on Graphs and Discrete Programming, ed. P. Hansen (North-Holland, 1981) pp. 61\u201368.","DOI":"10.1016\/S0304-0208(08)73458-3"},{"key":"BF02085649_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120905","volume":"13","author":"C. Edwards","year":"1980","unstructured":"C. Edwards, A branch and bound algorithm for the Koopmans-Beckman quadratic assignment problem, Math. Progr. Study 13(1980)35\u201352.","journal-title":"Math. Progr. Study"},{"key":"BF02085649_CR11","first-page":"61","volume":"31","author":"G. Finke","year":"1987","unstructured":"G. Finke, R. Burkard and F. Rendl, Quadratic assignment problems, Ann. Discr. Math. 31(1987)61\u201382.","journal-title":"Ann. Discr. Math."},{"key":"BF02085649_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","volume":"5","author":"A. Frieze","year":"1983","unstructured":"A. Frieze and J. Yadegar, On the quadratic assignment problem, Discr. Appl. Math, 5(1983)89\u201398.","journal-title":"Discr. Appl. Math"},{"key":"BF02085649_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979)."},{"key":"BF02085649_CR14","first-page":"305","volume":"10","author":"P. Gilmore","year":"1962","unstructured":"P. Gilmore, Optimal and suboptimal algorithms for the quadratic assignment problem. J. SIAM 10(1962)305\u2013313.","journal-title":"J. SIAM"},{"key":"BF02085649_CR15","volume-title":"System Simulation","author":"G. Gordon","year":"1969","unstructured":"G. Gordon,System Simulation (Prentice-Hall, Englewood Cliffs, NJ, 1969)."},{"key":"BF02085649_CR16","unstructured":"S. Hadley, F. Rendl and H. Wolkowicz, Bounds for the quadratic assignment problem using continuous optimization tehcniques, in:Integer Programming and Combinatorial Optimization (University of Waterloo Press, 1990) pp. 237\u2013248."},{"key":"BF02085649_CR17","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S. Hadley","year":"1992","unstructured":"S. Hadley, F. Rendl and H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem, Math. Oper. Res. 17(1992)727\u2013739.","journal-title":"Math. Oper. Res."},{"key":"BF02085649_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T. Koopmans","year":"1957","unstructured":"T. Koopmans and M. Beckmann, Assigned problems and the location of economic activities, Econometrica 25(1957)53\u201376.","journal-title":"Econometrica"},{"key":"BF02085649_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"J. Krarup and P. Pruzan, Computer-aided layout design, Math. Progr. Study 9(1978)75\u201394.","journal-title":"Math. Progr. Study"},{"key":"BF02085649_CR20","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. Lawler","year":"1963","unstructured":"E. Lawler, The quadratic assignment problem, Manag. Sci. 9(1963)586\u2013599.","journal-title":"Manag. Sci."},{"key":"BF02085649_CR21","volume-title":"A branch-and-bound algorithm for the quadratic assignment problem, Technical Report","author":"Y. Li","year":"1992","unstructured":"Y. Li, P. Pardalos, K. Ramakrishnan and M. Resende, A branch-and-bound algorithm for the quadratic assignment problem, Technical Report, AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 (December 1992)."},{"key":"BF02085649_CR22","doi-asserted-by":"crossref","unstructured":"Y. Li and P.M. Pardalos, Generating quadratic assignment test problems with known optimal permutations, Comp. Optim. Appl. (1992), to appear.","DOI":"10.1007\/BF00253805"},{"key":"BF02085649_CR23","first-page":"177","volume-title":"Recent Advances in Optimization and Parallel Computing","author":"Y. Li","year":"1922","unstructured":"Y. Li and P.M. Pardalos, Parallel algorithms for the quadratic assignment problem, in:Recent Advances in Optimization and Parallel Computing (Elsevier, Amsterdam, 1922) pp. 177\u2013189."},{"key":"BF02085649_CR24","unstructured":"K. Murthy, P. Pardalos and Y. Li, A local search algorithm for the quadratic assignment problem, Informatica 3(1992)."},{"key":"BF02085649_CR25","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C. Nugent","year":"1969","unstructured":"C. Nugent, T. Vollmann and J. Ruml, An experimental comparison of techniques for the assignment of facilities to locations, J. Oper. Res. 16(1969)150\u2013173.","journal-title":"J. Oper. Res."},{"key":"BF02085649_CR26","volume-title":"Fortran 77 for Engineers and Scientist","author":"L. Nyhoff","year":"1988","unstructured":"L. Nyhoff and S. Leestma,Fortran 77 for Engineers and Scientist, 2nd ed. (Macmillan, New York, 1988).","edition":"2nd ed."},{"key":"BF02085649_CR27","first-page":"1740","volume":"28","author":"G. Palubetskis","year":"1988","unstructured":"G. Palubetskis, Generation of quadratic assignment test problems with known optimal solutions, Zh. Vychisl. Mat. Fiz. 28(1988)1740\u20131743 (in Russian).","journal-title":"Zh. Vychisl. Mat. Fiz."},{"key":"BF02085649_CR28","doi-asserted-by":"crossref","unstructured":"P. Pardalos and J. Crouse, A parallel algorithm for the quadratic assignment problem, in:Proc. Supercomputing 1989 Conf. (ACM Press, 1989) pp. 351\u2013360.","DOI":"10.1145\/76263.76302"},{"key":"BF02085649_CR29","unstructured":"P. Paradalos and G. Rodgers, Parallel branch and bound algorithms for unconstrained quadratic 0\u20131 programming, in:Impact of Recent Advances on Operations Research (North-Holland, 1989) pp. 131\u2013143."},{"key":"BF02085649_CR30","doi-asserted-by":"crossref","unstructured":"P. Pardalos and J. Rosen,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science, No. 268 (Springer, 1987).","DOI":"10.1007\/BFb0000035"},{"key":"BF02085649_CR31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01585694","volume":"53","author":"F. Rendl","year":"1992","unstructured":"F. Rendl and H. Wolkowicz, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Math. Progr. 53(1992)63\u201378.","journal-title":"Math. Progr."},{"key":"BF02085649_CR32","volume-title":"Affection quadratique","author":"C. Roucairol","year":"1976","unstructured":"C. Roucairol, Affection quadratique, Ph.D. Thesis, Universit\u00e9 Pierre et Marie Curie, Paris VI (1976)."},{"key":"BF02085649_CR33","first-page":"183","volume":"32","author":"C. Roucairol","year":"1979","unstructured":"C. Roucairol, A reduction method for quadratic assignment problems, Oper. Res. Verfahren 32(1979)183\u2013187.","journal-title":"Oper. Res. Verfahren"},{"key":"BF02085649_CR34","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ro\/1979130302751","volume":"13","author":"C. Roucairol","year":"1979","unstructured":"C. Roucairol, Un nouvel algorithme pour le probl\u00e8me d'affectation quadratique, RAIRO 13(1979)275\u2013301.","journal-title":"RAIRO"},{"key":"BF02085649_CR35","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni and T. Gonzalez, P-complete approximation problems, J. ACM 23(1976)555\u2013565.","journal-title":"J. ACM"},{"key":"BF02085649_CR36","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/355826.355828","volume":"5","author":"L. Schrage","year":"1979","unstructured":"L. Schrage, A more portable Fortran random number generator, ACM Trans. Math. Software 5(1979)132\u2013138.","journal-title":"ACM Trans. Math. Software"},{"key":"BF02085649_CR37","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comp. 2(1990)33\u201345.","journal-title":"ORSA J. Comp."},{"key":"BF02085649_CR38","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp. 17(1991)443\u2013455.","journal-title":"Parallel Comp."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085649.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02085649\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:36:24Z","timestamp":1557794184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02085649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02085649"],"URL":"https:\/\/doi.org\/10.1007\/bf02085649","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}