{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:54Z","timestamp":1759063554632},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":[[1990,11]]},"DOI":"10.1007\/bf01588778","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:19:53Z","timestamp":1114676393000},"page":"49-70","source":"Crossref","is-referenced-by-count":41,"title":["The equipartition polytope. I: Formulations, dimension and basic facets"],"prefix":"10.1007","volume":"49","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R.","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(88)90144-5","volume":"26","author":"C. Arbib","year":"1988","unstructured":"C. Arbib, \u201cA polynomial algorithm for line-graph partitioning,\u201dInformation Processing Letters 26 (1988) 223\u2013230.","journal-title":"Information Processing Letters"},{"key":"CR2","first-page":"51","volume-title":"Modern Applied Mathematics \u2014 Optimization and Operations Research","author":"A. Bachem","year":"1982","unstructured":"A. Bachem and M. Gr\u00f6tschel, \u201cNew aspects of polyhedral theory,\u201d in: B. Korte, ed.,Modern Applied Mathematics \u2014 Optimization and Operations Research (North-Holland, Amsterdam, 1982) pp. 51\u2013106."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F. Barahona","year":"1986","unstructured":"F. Barahona, \u201cA solvable case of quadratic 0\u20131 programming,\u201dDiscrete Applied Mathematics 13 (1986) 23\u201326.","journal-title":"Discrete Applied Mathematics"},{"key":"CR4","volume-title":"\u201cOn the magnetization of the ground states in two-dimensional Ising spin glasses,\u201d Research Report","author":"F. Barahona","year":"1987","unstructured":"F. Barahona and A. Casari, \u201cOn the magnetization of the ground states in two-dimensional Ising spin glasses,\u201d Research Report, University of Waterloo (Waterloo, Ont., 1987)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"F. Barahona, M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cAn application of combinatorial optimization to statistical physics and circuit layout design,\u201dOperations Research 36 (1988) 493\u2013513.","journal-title":"Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/moor.10.2.340","volume":"10","author":"F. Barahona","year":"1985","unstructured":"F. Barahona, M. Gr\u00f6tschel and A.R. Mahjoub, \u201cFacets of the bipartite subgraph polytope,\u201dMathematics of Operations Research 10 (1985) 340\u2013358.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","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":"CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/moor.12.2.193","volume":"12","author":"M. Conforti","year":"1987","unstructured":"M. Conforti and M.R. Rao, \u201cSome new matroids on graphs, cutsets and the max-cut problem,\u201dMathematics of Operations Research 12 (1987) 93\u2013104.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and D.R. Fulkerson, \u201cBottleneck extrema,\u201dJournal of Combinatorial Theory 8 (1970) 299\u2013306.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR10","first-page":"89","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching, a well solved class of integer linear programs,\u201d in: R. Guy, H. Hanani, N. Sauer and J. Sch\u00f6neim, eds.,Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"CR11","first-page":"303","volume-title":"Graph Theory and its Applications","author":"D.R. Fulkerson","year":"1970","unstructured":"D.R. Fulkerson, \u201cBlocking polyhedra,\u201d in: B. Harris, ed.,Graph Theory and its Applications (Academic Press, New York, 1970) pp. 303\u2013334."},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan and S. Lin, \u201cAn efficient heuristic procedure for partitioning graphs,\u201dBell Systems Technical Journal 49(2) (1970) 291\u2013307.","journal-title":"Bell Systems Technical Journal"},{"key":"CR13","unstructured":"W. Pulleyblank, Private communication (1987)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588778.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588778\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:36:27Z","timestamp":1556883387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01588778"],"URL":"https:\/\/doi.org\/10.1007\/bf01588778","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}