{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:33:57Z","timestamp":1758054837089,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,5,19]],"date-time":"1998-05-19T00:00:00Z","timestamp":895536000000},"content-version":"vor","delay-in-days":444,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0012-365x(96)00199-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"531-545","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An analytic symmetrization of max flow-min cut"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Manfred","family":"Padberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Yi","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"Notes (for the three lectures given at Cornell University in the distinguished lecturer series)","year":"1987","author":"Balas","key":"10.1016\/S0012-365X(96)00199-9_BIB1"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","article-title":"The perfectly matchable subgraph polytope of a bipartite graph","volume":"13","author":"Balas","year":"1983","journal-title":"Networks"},{"article-title":"The perfectly matchable subgraph polytope of an arbitrary graph","year":"1987","author":"Balas","key":"10.1016\/S0012-365X(96)00199-9_BIB3"},{"year":"1963","series-title":"Linear Programming and Extensions","author":"Dantzig","key":"10.1016\/S0012-365X(96)00199-9_BIB4"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","article-title":"Note on maximum flow through a network","author":"Elias","year":"1956","journal-title":"IRE Trans. Inform. Theory, IT-2"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/S0012-365X(96)00199-9_BIB7"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB8","series-title":"Graph Theory and its Applications","first-page":"93","article-title":"Blocking polyhedra","author":"Fulkerson","year":"1970"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB9","first-page":"235","article-title":"On cut-set integer polyhedra","volume":"17","author":"Johnson","year":"1974","journal-title":"Cahiers Centre Rech. Oper."},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/S0012-365X(96)00199-9_BIB10"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB11_1","article-title":"On the width-length inequality","author":"Lehman","year":"1963","journal-title":"Mimeo"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB11_2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01588263","article-title":"On the width-length inequality","volume":"17","author":"Lehman","year":"1979","journal-title":"Math. Programming"},{"year":"1995","series-title":"Linear Optimization and Extensions","author":"Padberg","key":"10.1016\/S0012-365X(96)00199-9_BIB12"},{"key":"10.1016\/S0012-365X(96)00199-9_BIB13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","article-title":"An analytical comparison of different formulations of the traveling salesman problem","volume":"52","author":"Padberg","year":"1991","journal-title":"Math. Programming"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:02:20Z","timestamp":1757916140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96001999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":14,"alternative-id":["S0012365X96001999"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00199-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1997,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An analytic symmetrization of max flow-min cut","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0012-365X(96)00199-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}