{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:56:32Z","timestamp":1757454992251},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:26:56Z","timestamp":1330273616000},"page":"175-189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Quadratic knapsack relaxations using cutting planes and semidefinite programming"],"prefix":"10.1007","author":[{"given":"C.","family":"Helmberg","sequence":"first","affiliation":[]},{"given":"F.","family":"Rendl","sequence":"additional","affiliation":[]},{"given":"R.","family":"Weismantel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria and G. Cornuejols. A lift-and-project cutting plane algorithm for mixed 0\/1 programs, Mathematical Programming 58:295\u2013324, 1993.","journal-title":"Mathematical Programming"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C. Simone De","year":"1989","unstructured":"C. De Simone. The cut polytope and the boolean quadric polytope. Discrete Mathematics, 79:71\u201375, 1989.","journal-title":"Discrete Mathematics"},{"key":"14_CR3","unstructured":"C. E. Ferreira, A. Martin, C. De Souza, R. Weismantel and L. Wolsey. Formulations and valid inequalities for the node capacitated graph partitioning problem, CORE discussion paper No. 9437, Universit\u00e9 Catholique de Louvain, 1994. To appear in Mathematical Programming."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-59408-6_46","volume":"920","author":"C. Helmberg","year":"1995","unstructured":"C. Helmberg, S. Poljak, F. Rendl, and H. Wolkowicz. Combining Semidefinite and Polyhedral Relaxations for Integer Programs. Lecture Notes in Computer Science, 920:124\u2013134, 1995, Proceedings of IPCO 4 (E. Balas, J. Clausen eds).","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR5","unstructured":"C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM Journal on Optimization. To appear."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E. Johnson","year":"1993","unstructured":"E. Johnson, A. Mehrotra and G.L. Nemhauser. Min-cut clustering, Mathematical Programming 62:133\u2013152, 1993.","journal-title":"Mathematical Programming"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. Lov\u00e1sz and A. Schrijver. Cones of matrices and set functions and 0\u20131 optimization. SIAM J. Optimization, 1(2):166\u2013190, 1991.","journal-title":"SIAM J. Optimization"},{"key":"14_CR8","unstructured":"S. N\u00e4her and C. Uhrig. The LEDA User Manual Version R 3.3 beta. MaxPlanck-Institut f\u00fcr Informatik, Im Stadtwald, Building 46.1, D-66123 Saarbr\u00fccken, Germany, (http:\/\/www.mpi-sb.mpg.de\/LEDA\/leda.html)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BF01589101","volume":"45","author":"M. W. Padberg","year":"1989","unstructured":"M. W. Padberg. The boolean quadric polytope, Mathematical Programming 45:132\u2013172, 1989.","journal-title":"Mathematical Programming"},{"key":"14_CR10","unstructured":"R. Weismantel. On the 0\/1 knapsack polytope, Preprint SC 94-01, Konrad-Zuse-Zentrum Berlin, 1994."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:48:10Z","timestamp":1558255690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}