{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:14:33Z","timestamp":1767237273483},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,6,29]],"date-time":"2013-06-29T00:00:00Z","timestamp":1372464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10107-013-0688-2","type":"journal-article","created":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T04:25:16Z","timestamp":1372393516000},"page":"351-378","source":"Crossref","is-referenced-by-count":21,"title":["Lifting and separation procedures for the cut polytope"],"prefix":"10.1007","volume":"146","author":[{"given":"Thorsten","family":"Bonato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Rinaldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,6,29]]},"reference":[{"key":"688_CR1","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","year":"2012","unstructured":"Anjos, M., Lasserre, J. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization. Springer, Berlin (2012)"},{"key":"688_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"688_CR3","doi-asserted-by":"crossref","first-page":"10971","DOI":"10.1088\/0305-4470\/38\/50\/007","volume":"38","author":"D Avis","year":"2005","unstructured":"Avis, D., Imai, H., Ito, T., Sasaki, Y.: Two-party Bell inequalities derived from combinatorics via triangular elimination. J. Phys. A 38, 10971\u201310987 (2005)","journal-title":"J. Phys. A"},{"key":"688_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10107-006-0018-z","volume":"112","author":"D Avis","year":"2008","unstructured":"Avis, D., Imai, H., Ito, T.: Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112, 303\u2013325 (2008)","journal-title":"Math. Program."},{"key":"688_CR5","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1016\/j.dam.2007.03.005","volume":"155","author":"D Avis","year":"2007","unstructured":"Avis, D., Ito, T.: New classes of facets for the cut polytope and tightness of $$I_{mm22}$$ I m m 22 Bell inequalities. Discrete Appl. Math. 155, 1689\u20131699 (2007)","journal-title":"Discrete Appl. Math."},{"key":"688_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580600","volume":"60","author":"F Barahona","year":"1993","unstructured":"Barahona, F.: On cuts and matchings in planar graphs. Math. Program. 60, 53\u201368 (1993)","journal-title":"Math. Program."},{"key":"688_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157\u2013173 (1986)","journal-title":"Math. Program."},{"key":"688_CR8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36, 493\u2013513 (1988)","journal-title":"Oper. Res."},{"key":"688_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/moor.18.1.245","volume":"18","author":"E Boros","year":"1993","unstructured":"Boros, E., Hammer, P.L.: Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions. Math. Oper. Res. 18, 245\u2013253 (1993)","journal-title":"Math. Oper. Res."},{"key":"688_CR10","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.orl.2008.01.004","volume":"36","author":"C Buchheim","year":"2008","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Oper. Res. Lett. 36, 430\u2013433 (2008)","journal-title":"Oper. Res. Lett."},{"key":"688_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-6377(98)00022-4","volume":"23","author":"E Cheng","year":"1998","unstructured":"Cheng, E.: Separating subdivision of bicycle wheel inequalities over cut polytopes. Oper. Res. Lett. 23, 13\u201319 (1998)","journal-title":"Oper. Res. Lett."},{"key":"688_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0167-6377(90)90029-5","volume":"9","author":"C Simone De","year":"1990","unstructured":"De Simone, C.: Lifting facets of the cut polytope. Oper. Res. Lett. 9, 341\u2013344 (1990)","journal-title":"Oper. Res. Lett."},{"key":"688_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/10556789408805564","volume":"3","author":"C Simone De","year":"1994","unstructured":"De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optim. Methods Softw. 3, 195\u2013214 (1994)","journal-title":"Optim. Methods Softw."},{"key":"688_CR14","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C Simone De","year":"1995","unstructured":"De Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch and cut algorithm. J. Stat. Phys. 80, 487\u2013496 (1995)","journal-title":"J. Stat. Phys."},{"key":"688_CR15","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1007\/BF02174135","volume":"84","author":"C Simone De","year":"1996","unstructured":"De Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of two-dimensional $$\\pm J$$ \u00b1 J Ising spin glasses. J. Stat. Phys. 84, 1363\u20131371 (1996)","journal-title":"J. Stat. Phys."},{"key":"688_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics. Algorithms and Combinatorics","author":"MM Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)"},{"key":"688_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/moor.10.2.359","volume":"10","author":"AMH Gerards","year":"1985","unstructured":"Gerards, A.M.H.: Testing the odd bicycle wheel inequalities for the bipartite subgraph polytope. Math. Oper. Res. 10, 359\u2013360 (1985)","journal-title":"Math. Oper. Res."},{"key":"688_CR18","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"688_CR19","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"688_CR20","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw Pract Exp 30, 1325\u20131352 (2000)","journal-title":"Softw Pract Exp"},{"key":"688_CR21","first-page":"29","volume":"71","author":"M Laurent","year":"1995","unstructured":"Laurent, M., Poljak, S.: One-third-integrality in the max-cut problem. Math. Program. 71, 29\u201350 (1995)","journal-title":"Math. Program."},{"key":"688_CR22","unstructured":"Liers, F.: Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics. PhD Thesis, University of Cologne (2004)"},{"key":"688_CR23","doi-asserted-by":"crossref","unstructured":"Liers, F., J\u00fcnger, M., Reinelt, G., Rinaldi, G.: Computing exact ground states of hard Ising spin glass problems by branch-and-cut. In: Hartmann, A., Rieger, H. (eds.) New Optim. Algorithms Phys., pp. 47\u201370. Wiley-VCH, London (2004)","DOI":"10.1002\/3527603794.ch4"},{"key":"688_CR24","unstructured":"Mannino, C.: Personal communication (2011)"},{"key":"688_CR25","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/1006063","volume":"6","author":"G Marsaglia","year":"1964","unstructured":"Marsaglia, G., Bray, T.A.: A convenient method for generating normal variables. SIAM Rev. 6, 260\u2013264 (1964)","journal-title":"SIAM Rev."},{"key":"688_CR26","doi-asserted-by":"crossref","unstructured":"Poljak, S., Tuza, Z.: Maximum cuts and large bipartite subgraphs. In: Cook, W. et al. (eds.) Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 181\u2013244 (1995)","DOI":"10.1090\/dimacs\/020\/04"},{"key":"688_CR27","doi-asserted-by":"crossref","unstructured":"Rendl, F., et al.: Semidefinite relaxations for integer programming. In: J\u00fcnger, M. et al. (eds.) 50 years of Integer Programming 1958\u20132008: The Early Years and State-of-the-Art Surveys, pp. 687\u2013726. Springer, Berlin (2010)","DOI":"10.1007\/978-3-540-68279-0_18"},{"key":"688_CR28","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307\u2013335 (2010)","journal-title":"Math. Program."},{"key":"688_CR29","unstructured":"Rinaldi, G.: Rudy: a graph generator. http:\/\/www-user.tu-chemnitz.de\/~helmberg\/rudy.tar.gz (1998)"},{"key":"688_CR30","unstructured":"Wiegele, A.: BiqMac library. biqmac.uni-klu.ac.at\/biqmaclib.html (2007)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0688-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0688-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0688-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T16:20:58Z","timestamp":1563294058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0688-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,29]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["688"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0688-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,29]]}}}