{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:17:41Z","timestamp":1780589861144,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T00:00:00Z","timestamp":1273276800000},"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":[[2010,7]]},"DOI":"10.1007\/s10107-010-0377-3","type":"journal-article","created":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T22:33:24Z","timestamp":1273185204000},"page":"513-535","source":"Crossref","is-referenced-by-count":14,"title":["Speeding up IP-based algorithms for constrained quadratic 0\u20131 optimization"],"prefix":"10.1007","volume":"124","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Oswald","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,8]]},"reference":[{"issue":"10","key":"377_CR1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams W.P., Sherali H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"issue":"2","key":"377_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"W.P. Adams","year":"1990","unstructured":"Adams W.P., Sherali H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38(2), 217\u2013226 (1990)","journal-title":"Oper. Res."},{"key":"377_CR3","doi-asserted-by":"crossref","unstructured":"Applegate, A., Bixby, R., Chv\u00e1tal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, Lecture Notes in Computer Science, vol. 2241, pp. 261\u2013304. Springer (2001)","DOI":"10.1007\/3-540-45586-8_7"},{"key":"377_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona F., Mahjoub A.: On the cut polytope. Math. Program. 36, 157\u2013173 (1986)","journal-title":"Math. Program."},{"key":"377_CR5","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Liers, F., Oswald, M.: A basic toolbox for constrained quadratic 0\/1 optimization. In: McGeoch, C.C. (ed.) WEA 2008: Workshop on Experimental Algorithms, Lecture Notes in Computer Science, vol. 5038, pp. 249\u2013262. Springer (2008)","DOI":"10.1007\/978-3-540-68552-4_19"},{"key":"377_CR6","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.orl.2008.01.004","volume":"36","author":"C. Buchheim","year":"2008","unstructured":"Buchheim C., Liers F., Oswald M.: Local cuts revisited. Oper. Res. Lett. 36, 430\u2013433 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"377_CR7","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1137\/050646500","volume":"18","author":"C. Buchheim","year":"2007","unstructured":"Buchheim C., Rinaldi G.: Efficient reduction of polynomial zero-one optimization to the quadratic case. SIAM J. Optim. 18(4), 1398\u20131413 (2007)","journal-title":"SIAM J. Optim."},{"key":"377_CR8","first-page":"121","volume":"6","author":"C. Buchheim","year":"2009","unstructured":"Buchheim C., Rinaldi G.: Terse integer linear programs for boolean optimization. J. Satisf. Boolean Model. Comput. 6, 121\u2013139 (2009)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"1","key":"377_CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1287\/ijoc.1090.0318","volume":"22","author":"C. Buchheim","year":"2010","unstructured":"Buchheim C., Wiegele A., Zheng L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 22(1), 168\u2013177 (2010). doi: 10.1287\/ijoc.1090.0318","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"377_CR10","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.E., Rendl F.: QAPLIB\u2014a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"377_CR11","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1016\/j.ejor.2006.09.028","volume":"187","author":"A. Caprara","year":"2008","unstructured":"Caprara A.: Constrained 0\u20131 quadratic programming: basic approaches and extensions. Eur. J. Oper. Res. 187(3), 1494\u20131503 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"377_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C. De Simone","year":"1990","unstructured":"De Simone C.: The cut polytope and the Boolean quadric polytope. Discret. Math. 79, 71\u201375 (1990)","journal-title":"Discret. Math."},{"key":"377_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics, Algorithms and Combinatorics, vol. 15","author":"M. Deza","year":"1997","unstructured":"Deza M., Laurent M.: Geometry of Cuts and Metrics, Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)"},{"key":"377_CR14","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P.L. Hammer","year":"1965","unstructured":"Hammer P.L.: Some network flow problems solved with pseudo-boolean programming. Oper. Res. 13, 388\u2013399 (1965)","journal-title":"Oper. Res."},{"issue":"6","key":"377_CR15","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.dam.2007.12.008","volume":"157","author":"P. Hansen","year":"2009","unstructured":"Hansen P., Meyer C.: Improved compact linearizations for the unconstrained quadratic 0\u20131 minimization problem. Discret. Appl. Math. 157(6), 1267\u20131290 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"377_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C., Rendl F., Weismantel R.: A semidefinite programming approach to the quadratic knapsack problem. J. Comb. Optim. 4(2), 197\u2013215 (2000)","journal-title":"J. Comb. Optim."},{"key":"377_CR17","unstructured":"Johnson, T.A.: New Linear-Programming based Solution Procedures for the Quadratic Assignment Problem. Ph.D. thesis, Graduate School of Clemson University (1992)"},{"key":"377_CR18","first-page":"47","volume-title":"Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut. New Optimization Algorithms in Physics","author":"F. Liers","year":"2004","unstructured":"Liers F., J\u00fcnger M., Reinelt G., Rinaldi G.: Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut. New Optimization Algorithms in Physics, pp. 47\u201368. Wiley, Weinheim (2004)"},{"key":"377_CR19","doi-asserted-by":"crossref","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 4513, pp. 295\u2013309. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72792-7_23"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0377-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0377-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0377-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:08Z","timestamp":1559109008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0377-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,8]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["377"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0377-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,8]]}}}