{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:36:59Z","timestamp":1780627019641,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf02592198","type":"journal-article","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:18:08Z","timestamp":1177978688000},"page":"247-266","source":"Crossref","is-referenced-by-count":50,"title":["Formulations and valid inequalities for the node capacitated graph partitioning problem"],"prefix":"10.1007","volume":"74","author":[{"given":"C. E.","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Martin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. C.","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L. A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02592198_CR1","volume-title":"Optimal constrained rooted subtrees and partitioning problems on tree graphs","author":"E.H. Aghezzaf","year":"1992","unstructured":"E.H. Aghezzaf, \u201cOptimal constrained rooted subtrees and partitioning problems on tree graphs,\u201d Doctoral Thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium (1992)."},{"key":"BF02592198_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F. Barahona","year":"1983","unstructured":"F. Barahona, \u201cThe max-cut problem in graphs not contractible toK 5\u201dOperations Research Letters 2 (1983) 107\u2013111.","journal-title":"Operations Research Letters"},{"key":"BF02592198_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona and A.R. Mahjoub, \u201cOn the cut polytope,\u201dMathematical Programming 36 (1986) 157\u2013173.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S. Chopra","year":"1993","unstructured":"S. Chopra and M.R. Rao, \u201cThe partition problem,\u201dMathematical Programming 59 (1993) 87\u2013116.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","volume":"49","author":"M. Conforti","year":"1990","unstructured":"M. Conforti, M.R. Rao and A. Sassano, \u201cThe equipartition polytope I,\u201dMathematical Programming 49 (1990) 49\u201370.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01588779","volume":"49","author":"M. Conforti","year":"1990","unstructured":"M. Conforti, M.R. Rao and A. Sassano, \u201cThe equipartition polytope II,\u201dMathematical Programming 49 (1990) 71\u201390.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR7","unstructured":"C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel and L.A. Wolsey, \u201cThe node capacitated graph partitioning problem: A computational study, submitted."},{"key":"BF02592198_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi, \u201cFacets of the clique partitioning polytope,\u201dMathematical Programming 47 (1990) 367\u2013387.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi, \u201cA cutting plane algorithm for a clustering problem,\u201dMathematical Programming 45 (1989) 59\u201396.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E. Johnson","year":"1993","unstructured":"E. Johnson, A. Mehrotra and G.L. Nemhauser, \u201cMin-cut clustering,\u201dMathematical Programming 62 (1993) 133\u2013152.","journal-title":"Mathematical Programming"},{"key":"BF02592198_CR11","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":"T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Wiley, New York, 1990)."},{"key":"BF02592198_CR12","volume-title":"Annals of Discrete Mathematics 29","author":"L. Lovasz","year":"1986","unstructured":"L. Lovasz and M.D. Plummer, \u201cMatching theory,\u201d inAnnals of Discrete Mathematics 29 (North-Holland, Amsterdam, 1986)."},{"key":"BF02592198_CR13","volume-title":"The graph equipartition problem: Optimal solutions, extensions and applications","author":"C.C. Souza de","year":"1993","unstructured":"C.C. de Souza, \u201cThe graph equipartition problem: Optimal solutions, extensions and applications,\u201d Doctoral Thesis, Universit\u00e9 Catholique de Louvain Louvain-la-Neuve, Belgium (1993)."},{"key":"BF02592198_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(94)00151-3","volume":"62","author":"C.C. Souza de","year":"1995","unstructured":"C.C. de Souza and M. Laurent, \u201cSome new classes of facets for the equicut polytope,\u201dDiscrete Applied Mathematics 62 (1995) 167\u2013191.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02592198_CR15","volume-title":"Decomposition and column generation for integer programs","author":"F. Vanderbeck","year":"1994","unstructured":"F. Vanderbeck, \u201cDecomposition and column generation for integer programs,\u201d Doctoral Thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium (1994)."},{"key":"BF02592198_CR16","series-title":"Technical Report TR 92-3","volume-title":"Plazieren von Zellen: Theorie and L\u00f6sung eines quadratischen 0\u20131 Optimierungsproblem","author":"R. Weismantel","year":"1993","unstructured":"R. Weismantel, \u201cPlazieren von Zellen: Theorie and L\u00f6sung eines quadratischen 0\u20131 Optimierungsproblem,\u201d Technical Report TR 92-3, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin (1993)."},{"key":"BF02592198_CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, \u201cNon-separable and planar graphs,\u201dTransactions of the American Mathematical Society 34 (1932) 339\u2013362.","journal-title":"Transactions of the American Mathematical Society"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592198.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592198\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T12:17:40Z","timestamp":1587471460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF02592198"],"URL":"https:\/\/doi.org\/10.1007\/bf02592198","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}