{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:44:06Z","timestamp":1725900246338},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_22","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"236-247","source":"Crossref","is-referenced-by-count":4,"title":["Separable Non-convex Underestimators for Binary Quadratic Programming"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[]},{"given":"Emiliano","family":"Traversi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/1520-6750(199204)39:3<399::AID-NAV3220390309>3.0.CO;2-0","volume":"39","author":"A. Assad","year":"1992","unstructured":"Assad, A., Xu, W.: The quadratic minimum spanning tree problem. Naval Research Logistics\u00a039(3), 399\u2013417 (1992)","journal-title":"Naval Research Logistics"},{"issue":"6","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A. Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.-C.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: The QCR method. Discrete Applied Mathematics\u00a0157(6), 1185\u20131197 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-011-0475-x","volume":"135","author":"C. Buchheim","year":"2012","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming (Series A)\u00a0135(1-2), 369\u2013395 (2012)","journal-title":"Mathematical Programming (Series A)"},{"doi-asserted-by":"crossref","unstructured":"Buchheim, C., De Santis, M., Palagi, L., Piacentini, M.: An exact algorithm for quadratic integer minimization using nonconvex relaxations. Technical report, Optimization Online (2012)","key":"22_CR4","DOI":"10.1137\/120878495"},{"doi-asserted-by":"crossref","unstructured":"Palagi, L., Piccialli, V., Rendl, F., Rinaldi, G., Wiegele, A.: Computational approaches to Max-Cut. In: Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 821\u2013849. Springer (2012)","key":"22_CR5","DOI":"10.1007\/978-1-4614-0769-0_28"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:42:20Z","timestamp":1557704540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}