{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:12:02Z","timestamp":1725869522384},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_54","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"726-734","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Sourour","family":"Elloumi","sequence":"first","affiliation":[]},{"given":"Am\u00e9lie","family":"Lambert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"54_CR1","first-page":"197","volume":"109","author":"A Billionnet","year":"2001","unstructured":"Billionnet, A., Elloumi, S.: Best reduction of the quadratic semi-assignment problem. DAMATH: Discret. Appl. Math. Comb. Oper. Res. Comput. Sci. 109, 197\u2013213 (2001)","journal-title":"DAMATH: Discret. Appl. Math. Comb. Oper. Res. Comput. Sci."},{"issue":"1","key":"54_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Extending the QCR method to the case of general mixed integer program. Math. Program. 131(1), 381\u2013401 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"54_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10107-015-0921-2","volume":"158","author":"A Billionnet","year":"2016","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1), 235\u2013266 (2016)","journal-title":"Math. Program."},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"Billionnet, A., Elloumi, S., Lambert, A., Wiegele, A.: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation. Inf. J. Comput. (2016, to appear)","DOI":"10.1287\/ijoc.2016.0731"},{"issue":"1","key":"54_CR5","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, AC library for semidefinite programming. Optim. Methods Softw. 11(1), 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"54_CR6","first-page":"2741","volume-title":"Quadratic Assignment Problems","author":"RE Burkard","year":"2013","unstructured":"Burkard, R.E.: Quadratic Assignment Problems, pp. 2741\u20132814. Springer, New York (2013)"},{"key":"54_CR7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10, 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"key":"54_CR8","unstructured":"Helmberg, C.: Conic Bundle v0.3.10 (2011)"},{"key":"54_CR9","unstructured":"IBM-ILOG: IBM ILOG CPLEX 12.6 Reference Manual (2014). http:\/\/www-01.ibm.com\/support\/knowledgecenter\/SSSA5P_12.6.0\/ilog.odms.studio.help\/Optimization_Studio\/topics\/COS_home.html"},{"key":"54_CR10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1504\/IJMOR.2009.022879","volume":"1","author":"F Roupin","year":"2009","unstructured":"Roupin, F.: Semidefinite relaxations of the quadratic assignment problem in a lagrangian framework. Int. J. Math. Oper. Res. 1, 144\u2013162 (2009)","journal-title":"Int. J. Math. Oper. Res."},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. Assoc. Comput. Mach. 23, 555\u2013565 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"54_CR12","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.: Semidefinite relaxations for the quadratic assignment problem. J. Combin. Optim. 2, 71\u2013109 (1998)","journal-title":"J. Combin. Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T00:40:53Z","timestamp":1568508053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}