{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:51Z","timestamp":1751368011342},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:15:31Z","timestamp":1330258531000},"page":"124-134","source":"Crossref","is-referenced-by-count":17,"title":["Combining semidefinite and polyhedral relaxations for integer programs"],"prefix":"10.1007","author":[{"given":"C.","family":"Helmberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Poljak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Wolkowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","volume-title":"Technical Report TR-93-050","author":"F. Alizadeh","year":"1993","unstructured":"F. ALIZADEH. Interior point methods in semidefinite programming with applications to combinatorial optimization. Technical Report TR-93-050, International Computer Science Institute, Berkley, Sept. 1993."},{"key":"10_CR2","doi-asserted-by":"crossref","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\u20131 programs, Mathematical Programming 58:295\u2013324, 1993.","journal-title":"Mathematical Programming"},{"key":"10_CR3","volume-title":"Technical Report","author":"E. Balas","year":"1994","unstructured":"E. BALAS, S. CERIA, G. CORNUEJOLS and G. PATAKI. Polyhedral methods for the maximum clique problem. Technical Report, Carnegie Mellon University, Pittsburgh, USA, 1994."},{"key":"10_CR4","volume-title":"Technical Report","author":"E. Balas","year":"1994","unstructured":"E. BALAS, S. CERIA, G. CORNUEJOLS and G. PATAKI. Updated semi-definite constraints. Technical Report, Carnegie Mellon University, Pittsburgh, USA, 1994."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"F. BARAHONA, M. J\u00dcNGER and G. REINELT. Experiments in quadratic 0\u20131 programming, Mathematical Programming 44:127\u2013137, 1989.","journal-title":"Mathematical Programming"},{"issue":"3","key":"10_CR6","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C. Delorme","year":"1993","unstructured":"C. DELORME and S. POLJAK. Laplacian eigenvalues and the max-cut problem, Mathematical Programming, 62(3):557\u2013574, 1993.","journal-title":"Mathematical Programming"},{"key":"10_CR7","doi-asserted-by":"crossref","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"M.X. GOEMANS and D.P. WILLIAMSON. 878-approximation algorithm for max-cut and max-2sat. Technical Report, MIT, 1993.","DOI":"10.1145\/195058.195216"},{"key":"10_CR9","volume-title":"PhD thesis","author":"C. Helmberg","year":"1994","unstructured":"C. HELMBERG. An interior point method for semidefinite programming and max-cut bounds. PhD thesis, Graz University of Technology, Rechbauerstra\u00dfe 12, A-8010 Graz, Austria, Oct. 1994."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"C. HELMBERG, F. RENDL, R. J. VANDERBEI, and H. WOLKOWICZ. An interior-point method for semidefinite programming. SIAM Journal on Optimization. To appear.","DOI":"10.1137\/0806020"},{"key":"10_CR11","unstructured":"C. HELMBERG, F. RENDL, and R. WEISMANTEL. Quadratic knapsack relaxations using cutting planes and semidefinited programming. Working paper."},{"key":"10_CR12","unstructured":"M. LAURENT and S. POLJAK. On a positive semidefinite relaxation of the cut polytope. Rapport de Recherche 27, Laboratoire d'Informatique, URA 1327 du CNRS, D\u00e9partement de Math\u00e9matiques et d'Informatique, Ecole Normale Sup\u00e9rieure, Dec. 1993."},{"key":"10_CR13","volume-title":"Technical Report BS-R9502","author":"M. Laurent","year":"1995","unstructured":"M. LAURENT, S. POLJAK, and F. RENDL. Connections between semidefinite relaxations of the max-cut and stable set problems. Technical Report BS-R9502, Centrum voor Wiskunde en Informatica, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands, Jan. 1995."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"L. LOV\u00c1SZ. On the Shannon Capacity of a Graph. IEEE Trans. Inform. Theory, IT-25, 1979.","DOI":"10.1109\/TIT.1979.1055985"},{"issue":"2","key":"10_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. LOV\u00c1SZ 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"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:27:02Z","timestamp":1605630422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}