{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T23:26:55Z","timestamp":1707780415306},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,4,15]],"date-time":"2012-04-15T00:00:00Z","timestamp":1334448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s12532-012-0040-5","type":"journal-article","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T07:23:07Z","timestamp":1334388187000},"page":"275-306","source":"Crossref","is-referenced-by-count":17,"title":["LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison"],"prefix":"10.1007","volume":"4","author":[{"given":"Michael","family":"Armbruster","sequence":"first","affiliation":[]},{"given":"Marzena","family":"F\u00fcgenschuh","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Helmberg","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,15]]},"reference":[{"key":"40_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD-thesis, Technische Universit\u00e4t Berlin, Verlag Dr. Hut, M\u00fcnchen (2008)"},{"key":"40_CR2","unstructured":"Achterberg, T.: SCIP 1.1.0. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, 14195 Berlin-Dahlem, Germany. http:\/\/scip.zib.de (2009)"},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"40_CR4","unstructured":"Armbruster, M.: Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems. PhD-thesis, Technische Universit\u00e4t Chemnitz, Chemnitz, Germany (2007)"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Armbruster, M., F\u00fcgenschuh, M., Helmberg, C., Martin, A.: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Lodi, A., Panconesi, A., Rinaldi, G., (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 5035, pp. 112\u2013124. IPCO 2008. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-68891-4_8"},{"issue":"3","key":"40_CR6","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1137\/060675253","volume":"22","author":"M. Armbruster","year":"2008","unstructured":"Armbruster M., F\u00fcgenschuh M., Helmberg C., Martin A.: On the graph bisection cut polytope. SIAM J. Discrete Math. 22(3), 1073\u20131098 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"40_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. Progr. 36, 157\u2013173 (1986)","journal-title":"Math. Progr."},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10107-008-0215-z","volume":"120","author":"A. Belloni","year":"2009","unstructured":"Belloni A., Sagastiz\u00e1bal C.: Dynamic bundle methods. Math. Progr. 120, 289\u2013311 (2009)","journal-title":"Math. Progr."},{"key":"40_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","volume":"49","author":"M. Conforti","year":"1990","unstructured":"Conforti M., Rao M., Sassano A.: The equipartition polytope I. Math. Progr. 49, 49\u201370 (1990)","journal-title":"Math. Progr."},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01588779","volume":"49","author":"M. Conforti","year":"1990","unstructured":"Conforti M., Rao M., Sassano A.: The equipartition polytope II. Math. Progr. 49, 71\u201390 (1990)","journal-title":"Math. Progr."},{"key":"40_CR11","unstructured":"de Souza, C.C.: The graph equipartition problem: optimal solutions, extensions and applications. PhD-thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium (1993)"},{"key":"40_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15","author":"M. Deza","year":"1997","unstructured":"Deza M., Laurent M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol. 15. Springer, Berlin (1997)"},{"issue":"2","key":"40_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. Dolan","year":"2002","unstructured":"Dolan E., Mor\u00e9 J.J.: Benchmarking optimization software with performance profiles. Math. Progr. 91(2), 201\u2013213 (2002)","journal-title":"Math. Progr."},{"issue":"4","key":"40_CR14","doi-asserted-by":"crossref","first-page":"1828","DOI":"10.1137\/080742786","volume":"20","author":"A. Engau","year":"2010","unstructured":"Engau A., Anjos M.F., Vannelli A.: On interior-point warmstarts for linear and combinatorial optimization. SIAM J. Optim. 20(4), 1828\u20131861 (2010)","journal-title":"SIAM J. Optim."},{"key":"40_CR15","unstructured":"Engau, A., Anjos, M.F., Vannelli, A.: On handling cutting planes in interior-point methods for solving semidefinite relaxations of binary quadratic optimization problems. Technical Report, \u00c9cole Polytechnique de Montr\u00e9al, Canada. Optimization Methods and Software (to appear) (2010)"},{"key":"40_CR16","unstructured":"Eisenbl\u00e4tter, A.: Frequency assignment in GSM networks. PhD-thesis, Technische Universit\u00e4t Berlin, Berlin. ISBN 3-89873-213-4. ftp:\/\/ftp.zib.de\/pub\/zib-publications\/books\/PhD_eisenblaetter.ps.Z (2001)"},{"key":"40_CR17","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. Progr. 74, 247\u2013267 (1996)","journal-title":"Math. Progr."},{"issue":"2","key":"40_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"C.E. Ferreira","year":"1998","unstructured":"Ferreira C.E., Martin A., de Souza C.C., Weismantel R., Wolsey L.A.: The node capacitated graph partitioning problem: a computational study. Math. Progr. 81(2), 229\u2013256 (1998)","journal-title":"Math. Progr."},{"issue":"1","key":"40_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"Frieze A., Jerrum M.: Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"key":"40_CR20","unstructured":"F\u00fcgenschuh, M.: Relaxations and Solutions for the Minimum Graph Bisection Problem. Phd thesis, Darmstadt University of Technology, Darmstadt, Germany (2007)"},{"key":"40_CR21","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":"40_CR22","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396660","volume":"50","author":"J.R. Gilbert","year":"1987","unstructured":"Gilbert J.R., Tarjan R.E.: The analysis of a nested dissection algorithm. Numer. Math. 50, 377\u2013404 (1987)","journal-title":"Numer. Math."},{"key":"40_CR23","doi-asserted-by":"crossref","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 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"40_CR24","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S089547989631442X","volume":"21","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C.: Fixing variables in semidefinite relaxations. SIAM J. Matrix Anal. Appl. 21(3), 952\u2013969 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"40_CR25","unstructured":"Helmberg, C.: Semidefinite programming for combinatorial optimization. Habilitationsschrift TU Berlin, Jan. 2000; ZIB-Report ZR 00-34, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustra\u00dfe 7, 14195 Berlin, Germany (2000)"},{"key":"40_CR26","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. SIAM\/MPS (2004)","DOI":"10.1137\/1.9780898718805.ch15"},{"key":"40_CR27","unstructured":"Helmberg, C.: ConicBundle 0.3. Fakult\u00e4t f\u00fcr Mathematik, Technische Universit\u00e4t Chemnitz. http:\/\/www.tuchemnitz.de\/~helmberg\/ConicBundle (2009)"},{"issue":"2","key":"40_CR28","doi-asserted-by":"crossref","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. Progr. 93(2), 173\u2013194 (2002)","journal-title":"Math. Progr."},{"issue":"3","key":"40_CR29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg C., Rendl F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Progr. 82(3), 291\u2013315 (1998)","journal-title":"Math. Progr."},{"issue":"3","key":"40_CR30","doi-asserted-by":"crossref","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. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"40_CR31","unstructured":"ILOG, S.A.: 9 Rue de Verdun, 94253 Gentilly Cedex, France. ILOG AMPL CPLEX System, Version 12.1, User\u2019s Guide (2008)"},{"key":"40_CR32","doi-asserted-by":"crossref","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. Progr. 62, 133\u2013152 (1993)","journal-title":"Math. Progr."},{"issue":"3","key":"40_CR33","doi-asserted-by":"crossref","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. Progr. 63(3), 257\u2013279 (1994)","journal-title":"Math. Progr."},{"key":"40_CR34","unstructured":"Karypis, G., Kumar, V.: MeTiS: a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, version 4.0. Technical report, Department of Computer Science, University of Minnesota. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis (1998)"},{"key":"40_CR35","doi-asserted-by":"crossref","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. Discrete Appl. Math. 62, 167\u2013191 (1995)","journal-title":"Discrete Appl. Math."},{"key":"40_CR36","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. Wiley, Chichester (1990)"},{"issue":"1","key":"40_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT-25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory IT-25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"40_CR38","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1137\/S1052623497324242","volume":"10","author":"J.E. Mitchell","year":"2000","unstructured":"Mitchell J.E.: Computational experience with an interior point cutting plane algorithm. SIAM J. Optim. 10(4), 1212\u20131227 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"40_CR39","doi-asserted-by":"crossref","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. 5(3), 467\u2013487 (1995)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"40_CR40","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. Progr. 121(2), 307\u2013335 (2010)","journal-title":"Math. Progr."},{"key":"40_CR41","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"Weismantel R.: On the 0\/1 knapsack polytope. Math. Progr. 77, 49\u201368 (1997)","journal-title":"Math. Progr."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0040-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0040-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0040-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,5]],"date-time":"2020-07-05T22:35:22Z","timestamp":1593988522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0040-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,15]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["40"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0040-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,15]]}}}