{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:01Z","timestamp":1725514201758},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_8","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"112-124","source":"Crossref","is-referenced-by-count":13,"title":["A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem"],"prefix":"10.1007","author":[{"given":"Michael","family":"Armbruster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marzena","family":"F\u00fcgenschuh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Helmberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Achterberg, T.: Constraint integer programming. PhD-Thesis, PhD-Thesis, Technische Universit\u00e4t Berlin, Berlin (2007)"},{"key":"8_CR2","unstructured":"Armbruster, M., F\u00fcgenschuh, M., Helmberg, C., Martin, A.: On the bisection cut polytope. Technical Report, Chemnitz\/Darmstadt University of Technology (2007)"},{"key":"8_CR3","doi-asserted-by":"publisher","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. Prog.\u00a036, 157\u2013173 (1986)","journal-title":"Math. Prog."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01588778","volume":"49","author":"M. Conforti","year":"1990","unstructured":"Conforti, M., Rao, M.R., Sassano, A.: The equipartition polytope I, II. Math. Prog.\u00a049, 49\u201370 (1990)","journal-title":"Math. Prog."},{"key":"8_CR5","unstructured":"de Souza, C.C.: The graph equipartition problem: Optimal solutions, extensions and applications. PhD-Thesis, Universit\u00e9 Catholique de Louvain, Belgium (1993)"},{"key":"8_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics Algorithms and Combinatorics","author":"M. Deza","year":"1997","unstructured":"Deza, M., Laurent, M.: Geometry of Cuts and Metrics Algorithms and Combinatorics, vol.\u00a015. Springer, Heidelberg (1997)"},{"key":"8_CR7","unstructured":"Eisenbl\u00e4tter, A.: Frequency Assignment in GSM Networks. PhD-Thesis, Technische Universit\u00e4t Berlin, Berlin (2001)"},{"key":"8_CR8","first-page":"247","volume":"74","author":"C.E. Ferreira","year":"1996","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Prog.\u00a074, 247\u2013266 (1996)","journal-title":"Math. Prog."},{"key":"8_CR9","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF01396660","volume":"50","author":"J.R. Gilbert","year":"1979","unstructured":"Gilbert, J.R., Tarjan, R.E.: The analysis of a nested dissection algorithm. Numer. Math.\u00a050, 377\u2013404 (1979)","journal-title":"Numer. Math."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Helmberg, C.: A cutting plane algorithm for large scale semidefinite relaxations. In: Gr\u00f6tschel, M. (ed.) The Sharpest Cut. MPS-SIAM Series on Optimization, pp. 233\u2013256 (2004)","DOI":"10.1137\/1.9780898718805.ch15"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s101070100270","volume":"93","author":"C. Helmberg","year":"2002","unstructured":"Helmberg, C., Kiwiel, K.C.: A Spectral Bundle Method with Bounds. Math. Prog.\u00a093, 173\u2013194 (2002)","journal-title":"Math. Prog."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim.\u00a010(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(94)00151-3","volume":"62","author":"M. Laurent","year":"1995","unstructured":"Laurent, M., de Souza, C.C.: Some new classes of facets for the equicut polytope. Discr. App. Math.\u00a062, 167\u2013191 (1995)","journal-title":"Discr. App. Math."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E. Johnson","year":"1993","unstructured":"Johnson, E., Mehrotra, A., Nemhauser, G.: Min-cut clustering. Math. Prog.\u00a062, 133\u2013152 (1993)","journal-title":"Math. Prog."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01582072","volume":"63","author":"M. J\u00fcnger","year":"1994","unstructured":"J\u00fcnger, M., Martin, A., Reinelt, G., Weismantel, R.: Quadratic 0\/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Prog. B\u00a063(3), 257\u2013279 (1994)","journal-title":"Math. Prog. B"},{"key":"8_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley and Sons Ltd., Chichester (1990)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0805024","volume":"5","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F.: Nonpolyhedral relaxations of graph-bisection problems. SIAM J. Optim.\u00a05(3), 467\u2013487 (1995)","journal-title":"SIAM J. Optim."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Rendl","year":"2007","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 295\u2013309. Springer, Heidelberg (2007)"},{"key":"8_CR21","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"Weismantel, R.: On the 0\/1 Knapsack polytope. Math. Prog.\u00a077, 49\u201368 (1997)","journal-title":"Math. Prog."}],"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\/978-3-540-68891-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:29:54Z","timestamp":1605763794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_8","relation":{},"subject":[]}}