{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:44:00Z","timestamp":1743011040288},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T00:00:00Z","timestamp":1180483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10288-007-0044-6","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T09:17:47Z","timestamp":1180430267000},"page":"187-190","source":"Crossref","is-referenced-by-count":4,"title":["Quadratic convex reformulations for quadratic 0\u20131 programming"],"prefix":"10.1007","volume":"6","author":[{"given":"Marie-Christine","family":"Plateau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,30]]},"reference":[{"key":"44_CR1","unstructured":"Billionnet A (2005) Optimisation combinatoire, concepts fondamentaux. chapt. 7, Lavoisier, pp 191\u2013236"},{"key":"44_CR2","unstructured":"Billionnet A, Elloumi S, Plateau M-C (2006) Quadratic 0\u20131 programming: tightening linear or quadratic convex reformulation by use of relaxations. RAIRO\/Operations Res (forthcoming)"},{"key":"44_CR3","first-page":"115","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros E, Hammer PL (2002) Pseudo-boolean optimization. Discrete Appl Math 123:115\u2013225","journal-title":"Discrete Appl Math"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","volume":"5","author":"P Hansen","year":"1993","unstructured":"Hansen P, Jaumard B, Mathon V (1993) Constrained nonlinear 0\u20131 programming. ORSA J Comput 5:97\u2013119","journal-title":"ORSA J Comput"},{"issue":"3","key":"44_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/ijoc.12.3.177.12637","volume":"13","author":"SE Karisch","year":"2000","unstructured":"Karisch SE, Rendl F, Clausen J (2000) Solving graph bisection problems with semidefinite programming. INFORMS J Comput 13(3):177\u2013191","journal-title":"INFORMS J Comput"},{"key":"44_CR6","unstructured":"Plateau M-C, Billionnet A, Elloumi S (2005) Eigenvalue methods for linearly constrained quadratic 0\u20131 problems with application to the densest k-subgraph problem. In: 6\u00e8me congr\u00e8s ROADEF, Tours, 14\u201316 f\u00e9vrier, Presses Universitaires Francois Rabelais, pp 55\u201366"},{"key":"44_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems","author":"HD Sherali","year":"1999","unstructured":"Sherali HD, Adams WP (1999) A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Norwell"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0044-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0044-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0044-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0044-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,30]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0044-6","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,30]]}}}