{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:39:46Z","timestamp":1769297986218,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":[[1993,2]]},"DOI":"10.1007\/bf01585164","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:16:57Z","timestamp":1114679817000},"page":"133-151","source":"Crossref","is-referenced-by-count":183,"title":["Min-cut clustering"],"prefix":"10.1007","volume":"62","author":[{"given":"Ellis L.","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Anuj","family":"Mehrotra","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona and R. Majhoub, \u201cOn the cut polytope,\u201dMathematical Programming 36 (1986) 157\u2013173.","journal-title":"Mathematical Programming"},{"key":"CR2","volume-title":"The graph partitioning polytope on series-parallel and 4-wheel free graphs","author":"S. Chopra","year":"1991","unstructured":"S. Chopra, \u201cThe graph partitioning polytope on series-parallel and 4-wheel free graphs,\u201d J.L. Kellogg Graduate School of Management, Northwestern University (Evanston, IL, 1991)."},{"key":"CR3","volume-title":"The partition problem","author":"S. Chopra","year":"1990","unstructured":"S. Chopra and M.R. Rao, \u201cThe partition problem,\u201d J.L. Kellogg Graduate School of Management, Northwestern University (Evanston, IL, 1990)."},{"key":"CR4","volume-title":"Facets of thek-partition polytope","author":"S. Chopra","year":"1991","unstructured":"S. Chopra and M.R. Rao, \u201cFacets of thek-partition polytope,\u201d J.L. Kellogg Graduate School of Management, Northwestern University (Evanston, IL, 1991)."},{"key":"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: Formulations, dimension and basic facets,\u201dMathematical Programming 49 (1990) 49\u201370.","journal-title":"Mathematical Programming"},{"key":"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: Valid inequalities, and facets,\u201dMathematical Programming 49 (1990) 71\u201390.","journal-title":"Mathematical Programming"},{"key":"CR7","unstructured":"E. Dahlaus, D.S. Johnson, C.H. Papadimitriou, P. Seymour and M. Yanakakis, \u201cThe complexity of multiway cuts,\u201d extended abstract (1983)."},{"key":"CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"key":"CR9","unstructured":"O. Goldschmidt and D.S. Hochbaum, \u201cAn O(|V|2) algorithm for thek-cut problem,\u201dProceedings 29th Annual Symposium on Foundations of Computer Science (1985) pp. 444\u2013451."},{"key":"CR10","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 (Series B) 45 (1989) 59\u201396.","journal-title":"Mathematical Programming (Series B)"},{"key":"CR11","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":"CR12","volume-title":"NATO ASI Series, F51, Algorithms and Model Formulations in Mathematical Programming","author":"E.L. Johnson","year":"1989","unstructured":"E.L. Johnson, \u201cModeling and strong linear programs for mixed integer programming,\u201dNATO ASI Series, F51, Algorithms and Model Formulations in Mathematical Programming (Springer, Berlin, 1989)."},{"key":"CR13","volume-title":"Constrained graph partitioning: decomposition, polyhedral structure and algorithms","author":"A. Mehrotra","year":"1992","unstructured":"A. Mehrotra, \u201cConstrained graph partitioning: decomposition, polyhedral structure and algorithms,\u201d PhD Dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1992)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-6377(91)90003-8","volume":"10","author":"G.L. Nemhauser","year":"1991","unstructured":"G.L. Nemhauser and S. Park, \u201cA polyhedral approach to edge coloring,\u201dOperations Research Letters 10 (1991) 315\u2013322.","journal-title":"Operations Research Letters"},{"key":"CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"M. Padberg, \u201cThe Boolean quadratic polytope: Some characteristics, facets and relatives,\u201dMathematical Programming (Series B) 45 (1989) 139\u2013172.","journal-title":"Mathematical Programming (Series B)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585164.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585164\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T08:38:33Z","timestamp":1706171913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01585164"],"URL":"https:\/\/doi.org\/10.1007\/bf01585164","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}