{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T13:58:44Z","timestamp":1781791124553,"version":"3.54.5"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T00:00:00Z","timestamp":1158624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,1,30]]},"DOI":"10.1007\/s10107-006-0038-8","type":"journal-article","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T05:00:22Z","timestamp":1158555622000},"page":"505-524","source":"Crossref","is-referenced-by-count":42,"title":["Bounds for the quadratic assignment problem using the bundle method"],"prefix":"10.1007","volume":"109","author":[{"given":"Franz","family":"Rendl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renata","family":"Sotirov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,9,19]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Adams, W.P., Johnson, T.A.: Improved linear programming-based lower bounds for the quadratic assignment problem. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computes Sciences, vol.16, pp. 43\u201375. American Mathematical Society (1994)","DOI":"10.1090\/dimacs\/016\/02"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"K. Anstreicher","year":"2003","unstructured":"Anstreicher K. (2003): Recent advances in the solution of quadratic assignment problems. Mathe. Program. B 97, 27\u201342","journal-title":"Mathe. Program. B"},{"key":"38_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/PL00011402","volume":"89","author":"K. Anstreicher","year":"2001","unstructured":"Anstreicher K., Brixius N. (2001): A new bound for the quadratic assignment problem based on convex quadratic programming. Mathe. Program. 89, 341\u2013357","journal-title":"Mathe. Program."},{"key":"38_CR4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s101070100255","volume":"91","author":"K. Anstreicher","year":"2002","unstructured":"Anstreicher K., Brixius N., Goux J.-P., Linderoth J. (2002): Solving large quadratic assignment problems on computational grids. Mathe. Program. B 91, 563\u2013588","journal-title":"Mathe. Program. B"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S. Burer","year":"2005","unstructured":"Burer S., Monteiro R.D.C. (2005): Local minima and convergence in low-rank semidefinite programming. Mathe. Program. 103, 427\u2013444","journal-title":"Mathe. Program."},{"issue":"3","key":"38_CR6","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer S., Vandenbussche D. (2006): Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16(3): 726\u2013750","journal-title":"SIAM J. Optim."},{"key":"38_CR7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard R.E., Karisch S., Rendl F. (1997): QAPLIB \u2013 A quadratic assignment problem library. J. Global Optim. 10, 391\u2013403","journal-title":"J. Global Optim."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Burkard, R., Cela, E., Pardalos, P.M., Pitsoulis, L.: The quadratic assignment problem. In: Du, D.-Z., Pardalos, P.M., (eds.) Handbook of Combinatorial Optimization. Kluwer Dordrechet vol. 3, pp. 241\u2013337 (1999)","DOI":"10.1007\/978-1-4757-3023-4_2"},{"key":"38_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The quadratic assignment problem: Theory and Algorithms","author":"F. \u00c7ela","year":"1998","unstructured":"\u00c7ela F. (1998): The quadratic assignment problem: Theory and Algorithms. Kluwer, Massachessets"},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1008696503659","volume":"8","author":"J. Clausen","year":"1997","unstructured":"Clausen J., Perregaard M. (1997): Solving large quadratic assignment problems in parallel. Computa. Optimi. Appl. 8, 111\u2013127","journal-title":"Computa. Optimi. Appl."},{"key":"38_CR11","first-page":"61","volume":"31","author":"G. Finke","year":"1987","unstructured":"Finke G., Burkard R.E., Rendl F. (1987): Quadratic assignment problems. Ann. Discrete Mathe. 31, 61\u201382","journal-title":"Ann. Discrete Mathe."},{"key":"38_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-005-0661-9","volume":"105","author":"I. Fischer","year":"2006","unstructured":"Fischer I., Gruber G., Rendl F., Sotirov R. (2006): Computational experience with a bundle approach for semidefinite cutting plane relaxations of max-cut and equipartition. Mathe. Program. B, 105, 451\u2013469","journal-title":"Mathe. Program. B,"},{"key":"38_CR13","unstructured":"Foster, I., Kesselman, C.: Computational grids. In: Foster, I., Kesselman, C.: (eds.) The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)"},{"key":"38_CR14","volume-title":"Kronecker Products and Matrix Calculus with Applications. Mathematics and its Applications.","author":"A. Graham","year":"1981","unstructured":"Graham A. (1981): Kronecker Products and Matrix Calculus with Applications. Mathematics and its Applications. Ellis Horwood Limited, Chichester"},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S.W. Hadley","year":"1992","unstructured":"Hadley S.W., Rendl F., Wolkowicz H. (1992): A new lower bound via projection for the quadratic assignment problem. Mathe. Oper. Res. 17, 727\u2013739","journal-title":"Mathe. Oper. Res."},{"key":"38_CR16","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(97)00063-5","volume":"108","author":"P.M. Hahn","year":"1998","unstructured":"Hahn P.M., Grant T., Hall N. (1998): A branch\u2013and\u2013bound algorithm for the quadratic assignment problem based on the hungarian method. Eur. J. Oper. Res. 108, 629\u2013640","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR17","first-page":"41","volume":"11","author":"P.M. Hahn","year":"2001","unstructured":"Hahn P.M., Hightower W.L., Johnson T.A., Guignard\u2013Spielberg M., Roucairol C. (2001): Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugosl. J. Oper. Res. 11, 41\u201360","journal-title":"Yugosl. J. Oper. Res."},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Helmberg, C.: A cutting plane algorithm for large scale semidefinite relaxations. In: Gr\u00f6tschel, M. (ed.) Padberg Festschrift: The Sharpest Cut, MPS-SIAM, pp. 233\u2013256 (2004)","DOI":"10.1137\/1.9780898718805.ch15"},{"issue":"3","key":"38_CR19","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C., Rendl F. (2000): A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3): 673\u201369","journal-title":"SIAM J. Optim."},{"key":"38_CR20","volume-title":"Convex Analysis and Minimization Algorithms II","author":"B. Hiriart\u2013Urruty J.","year":"1991","unstructured":"Hiriart\u2013Urruty J. B., Lemar\u00e9chal C. (1991): Convex Analysis and Minimization Algorithms II. Springer, Berlin Heidelberg New York"},{"key":"38_CR21","unstructured":"Karisch S.E. (1995). Nonlinear Approaches for Quadratic Assignment and Graph Partition Problems. Dissertation, Technical University of Graz, Austria"},{"key":"38_CR22","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s006070050040","volume":"63","author":"S.E. Karisch","year":"1999","unstructured":"Karisch S.E., \u00c7ela E., Clausen J., Espersen T. (1999): A dual framework for lower bounds of the quadratic assignment problem based on linearization. Computing 63, 351\u2013403","journal-title":"Computing"},{"key":"38_CR23","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","year":"2000","unstructured":"Pardalos P.M., Pitsoulis L. (eds) (2000): Nonlinear Assignment Problems: Algorithms and Applications. Kluwer, Dordrecht"},{"key":"38_CR24","unstructured":"Pardalos, P.M., Wolkowicz, H. (eds.): Quadratic Assignment and Related Problems. American Mathematical Society, Providence, RI, (1994). Papers from the workshop held at Rutgers University, New Brunswick, New Jersey, May 20\u201321 (1993)"},{"key":"38_CR25","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-642-56082-8_14","volume-title":"Facility Location: Applications and Theory.","author":"F. Rendl","year":"2002","unstructured":"Rendl F. (2002): The quadratic assignment problem. In: Drezner Z., Hamacher H.W. (eds) Facility Location: Applications and Theory. Springer, Berlin Heidelberg New York, pp. 439\u2013457"},{"key":"38_CR26","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01585694","volume":"53","author":"F. Rendl","year":"1992","unstructured":"Rendl F., Wolkowicz H. (1992): Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Mathe. Program 53, 63\u201378","journal-title":"Mathe. Program"},{"issue":"5","key":"38_CR27","first-page":"63","volume":"43","author":"M.G.C. Resende","year":"1992","unstructured":"Resende M.G.C., Ramakrishnan K.G., Drezner Z. (1992): Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. 43(5): 63\u201378","journal-title":"Oper. Res."},{"key":"38_CR28","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni S., Gonzales T. (1976): P-complete approximation problems. J. ACM 23, 555\u2013565","journal-title":"J. ACM"},{"key":"38_CR29","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H. Schramm","year":"1992","unstructured":"Schramm H., Zowe J. (1992): A version of the bundle idea for minimizing a nonsmooth function: conceptional idea, convergence analysis, numerical results. SIAM J. Optim. 2, 121\u2013152","journal-title":"SIAM J. Optim."},{"key":"38_CR30","unstructured":"Sotirov, R.: Bundle Methods in Combinatorial Optimization. Dissertation, University of Klagenfurt, Austria (2003)"},{"key":"38_CR31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q. Zhao","year":"1998","unstructured":"Zhao Q., Karisch S.E., Rendl F., Wolkowicz H. (1998): Semidefinite programming relaxations for the quadratic assignment problem. J. Combi. Optim. 2, 71\u2013109","journal-title":"J. Combi. Optim."},{"key":"38_CR32","doi-asserted-by":"crossref","unstructured":"Zowe, J.: Nondifferentiable optimization \u2013 a motivation and a short introduction into the subgradient \u2013 and the bundle concept. In: Schittkowski, K. (eds.) NATO ASI Series, vol. 15, Computational Mathematical Programming. Springer, Berlin Heidelberg New York (1985)","DOI":"10.1007\/978-3-642-82450-0_12"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0038-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0038-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0038-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:01Z","timestamp":1559109001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0038-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,19]]},"references-count":32,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,1,30]]}},"alternative-id":["38"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0038-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,19]]}}}