{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:47:26Z","timestamp":1725551246696},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633976"},{"type":"electronic","value":"9783540695363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63397-9_20","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"259-270","source":"Crossref","is-referenced-by-count":0,"title":["Fixing variables in semidefinite relaxations"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Heimberg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"issue":"2","key":"20_CR1","first-page":"111","volume":"77","author":"F. Alizadeh","year":"1997","unstructured":"F. Alizadeh, J.-P. A. Haeberly, and M. L. Overton. Coplementarity and nondegeneracy in semidefinite programming. Mathematical Programming, 77(2):111\u2013128, 1997.","journal-title":"Mathematical Programming"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"F. Barahona, M. J\u00fcnger, and G. Reinelt. Experiments in quadratic 0-1 programming. Mathematical Programming, 44:127\u2013137, 1989.","journal-title":"Mathematical Programming"},{"key":"20_CR3","first-page":"71","volume":"79","author":"C. Simone De","year":"1989","unstructured":"C. De Simone. The cut polytope and the boolean quadric polytope. Discrete Applied Mathematics, 79:71\u201375, 1989.","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson. Improved approxiamtion algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115\u20131145, 1995.","journal-title":"J. ACM"},{"key":"20_CR5","unstructured":"G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, 2nd edition, 1989."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, 2nd edition, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"C. Helmberg, S. Poljak, F. Rendl, and H. Wolkowicz. Combining semidefinite and polyhedral relaxations for integer programs. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, volume 920 of Lecture Notes in Computer Science, pages 124\u2013134. Springer, May 1995.","DOI":"10.1007\/3-540-59408-6_46"},{"key":"20_CR8","unstructured":"C. Helmberg and F. Rendl. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. ZIB Preprint SC-95-35, Konrad Zuse Zentrum f\u00fcr Informationstechnik Berlin, Takustra\u00dfe 7, D-14195 Dahlem, Germany, Nov. 1995."},{"key":"20_CR9","unstructured":"S. E. Karisch and F. Rendl. Semidefinite programming and graph equipartition. Technical Report 302, Department of Mathematics, Graz University of Technology, Graz, Austria, Dec. 1995."},{"issue":"2","key":"20_CR10","first-page":"225","volume":"77","author":"M. Laurent","year":"1997","unstructured":"M. Laurent, S. Poljak, and F. Rendl. Connections between semidefinite relaxations of the max-cut and stable set problems. Mathematical Programming, 77(2):225\u2013246, 1997.","journal-title":"Mathematical Programming"},{"issue":"1","key":"20_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25(1):1\u20137, Jan. 1979.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"20_CR12","doi-asserted-by":"crossref","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-1 optimization. SIAM J. Optimization, 1(2):166\u2013190, May 1991.","journal-title":"SIAM J. Optimization"},{"key":"20_CR13","volume-title":"Self-scaled barriers and interior-point methods for convex programming","author":"Y. Nesterov","year":"1994","unstructured":"Y. Nesterov and M. J. Todd. Self-scaled barriers and interior-point methods for convex programming. Technical Report TR 1091, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853, Apr. 1994. Revised June 1995, to appear in Mathematics of Operations Research."},{"key":"20_CR14","volume-title":"Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization","author":"L. Tun\u00e7el","year":"1996","unstructured":"L. Tun\u00e7el. Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization. CORR Report 96-18, Department of Combinatorics and Optimization, Univeristy of Waterloo, Ontario, Canada, Nov. 1996."},{"key":"20_CR15","unstructured":"A.C. Williams. Quadratic 0-1 programming using the roof dual with computational results. RUTCOR Research Report 8-85, Rutgers Unversity, 1985."},{"key":"20_CR16","volume-title":"Semidefinite programming relaxations for the graph partitioning problem","author":"H. Wolkowicz","year":"1996","unstructured":"H. Wolkowicz and Q. Zhao. Semidefinite programming relaxations for the graph partitioning problem. Corr report, University of Waterloo, Ontario, Canada, Oct. 1996."},{"key":"20_CR17","volume-title":"Semidefinite programming relaxations for the quadratic assignment problem","author":"Q. Zhao","year":"1996","unstructured":"Q. Zhao, S. E. Karisch, F. Rendl, and H. Wolkowicz. Semidefinite programming relaxations for the quadratic assignment problem. CORR Report 95\/27, University of Waterloo, Ontario, Canada, Sept. 1996."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63397-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:16:10Z","timestamp":1559002570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63397-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633976","9783540695363"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-63397-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}