{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:39Z","timestamp":1725549939552},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_75","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"850-861","source":"Crossref","is-referenced-by-count":4,"title":["A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Alain","family":"Faye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"75_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/PL00011402","volume":"89","author":"K. Anstreicher","year":"2001","unstructured":"Anstreicher, K., Brixius, N.: A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming. Math. Prog.\u00a089, 341\u2013357 (2001)","journal-title":"Math. Prog."},{"issue":"3","key":"75_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(00)00257-2","volume":"109","author":"A. Billionnet","year":"2001","unstructured":"Billionnet, A., Elloumi, S.: Best reduction of the quadratic semi-assignment problem. Discrete Applied Mathematics\u00a0109(3), 197\u2013213 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"75_CR3","first-page":"35","volume":"41","author":"A. Blanchard","year":"2003","unstructured":"Blanchard, A., Elloumi, S., Faye, A., Wicker, N.: Un algorithme de g\u00e9n\u00e9ration de coupes pour le probl\u00e8me de l\u2019affectation quadratique. INFOR\u00a041(1), 35\u201349 (2003)","journal-title":"INFOR"},{"key":"75_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB. A Quadratic Assignment Problem Library. J. of Global Opt.\u00a010, 391\u2013403 (1997)","journal-title":"J. of Global Opt."},{"key":"75_CR5","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.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Massachessets (1998)"},{"key":"75_CR6","unstructured":"Faye, A., Roupin, F.: Partial Lagrangian and Semidefinite Relaxations of Quadratic Problems. In: Proceedings ROADEF 2005, Tours, February 14-16, Research report RC673 (2005), available at \n                  \n                    http:\/\/cedric.cnam.fr"},{"issue":"3, A","key":"75_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Progr.\u00a082(3, A), 291\u2013315 (1998)","journal-title":"Math. Progr."},{"key":"75_CR8","unstructured":"Helmberg, C.: Semidefinite Programming for Combinatorial Optimization. Habilitationsschrift, TU Berlin, ZIB-report ZR-00-34, KZZI, Takustra\u00dfe 7, 14195, Berlin, Germany (2000)"},{"issue":"3","key":"75_CR9","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim.\u00a010(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"75_CR10","unstructured":"Hemberg, C.: A C++ implementation of the Spectral Bundle Method, \n                  \n                    http:\/\/www-user.tu-chemnitz.de\/~helmberg\/SBmethod\/"},{"key":"75_CR11","unstructured":"Helmberg, C.: Cutting planes algorithm for large scale semidefinite relaxations. ZIB-Report ZR 01-26, KZZI, Takustra\u00dfe 7, 14195 Berlin, Germany (2001)"},{"key":"75_CR12","unstructured":"Delaporte, G., Jouteau, S., Roupin, F.: SDP_S: a Tool to formulate and solve Semidefinite relaxations for Bivalent Quadratic problems. In: Proceedings ROADEF 2003, Avignon 26-28 F\u00e9vrier (2003), \n                  \n                    http:\/\/semidef.free.fr"},{"key":"75_CR13","unstructured":"Karisch, S.E.: Nonlinear approaches for the quadratic assignment and graph partition problems. PhD thesis, Graz University of Technology, Graz, Austria (1995)"},{"key":"75_CR14","unstructured":"Lemarechal, C., Oustry, F.: Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. RR-3710, INRIA Rhone-Alpes (1999)"},{"issue":"2","key":"75_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10107-002-0355-5","volume":"95","author":"H.D. Mittelmann","year":"2003","unstructured":"Mittelmann, H.D.: An Independent Benchmarking of SDP and SOCP Solvers. Math. Progr.\u00a095(2), 407\u2013430 (2003)","journal-title":"Math. Progr."},{"key":"75_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. of Global Opt.\u00a07, 51\u201373 (1995)","journal-title":"J. of Global Opt."},{"key":"75_CR17","unstructured":"Rendl, F., Sotirov, R.: Bounds for the Quadratic Assignment Problem Using the Bundle Method. Research Report, University of Klagenfurt, Universitaetsstrasse 65-67, Austria (2003), Available at: \n                  \n                    Optimization-online.org"},{"issue":"5","key":"75_CR18","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1287\/opre.43.5.781","volume":"43","author":"M.G.C. Resende","year":"1995","unstructured":"Resende, M.G.C., Ramakrishnan, K.G., Drezner, Z.: Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research\u00a043(5), 781\u2013791 (1995)","journal-title":"Operations Research"},{"issue":"4","key":"75_CR19","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10878-004-4838-6","volume":"8","author":"F. Roupin","year":"2004","unstructured":"Roupin, F.: From Linear to Semidefinite Programming: an Algorithm to obtain Semidefinite Relaxations for Bivalent Quadratic Problems. J. of Comb. Opt.\u00a08(4), 469\u2013493 (2004)","journal-title":"J. of Comb. Opt."},{"issue":"1","key":"75_CR20","doi-asserted-by":"publisher","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.: Semidefinite programming relaxations for the quadratic assignment problem. J. of Comb. Opt.\u00a02(1), 71\u2013109 (1998)","journal-title":"J. of Comb. Opt."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:39Z","timestamp":1619507619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11561071_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}