{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:17Z","timestamp":1740122417036,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1819229"],"award-info":[{"award-number":["1819229"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000153","name":"Division of Biological Infrastructure","doi-asserted-by":"publisher","award":["1661348"],"award-info":[{"award-number":["1661348"]}],"id":[{"id":"10.13039\/100000153","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01120-2","type":"journal-article","created":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T11:02:00Z","timestamp":1712833320000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tight max-flow min-cut duality theorem for nonlinear multicommodity flows"],"prefix":"10.1007","volume":"47","author":[{"given":"Matthew","family":"Broussard","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2727-6547","authenticated-orcid":false,"given":"Bala","family":"Krishnamoorthy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,11]]},"reference":[{"key":"1120_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Pearson, London"},{"key":"1120_CR2","doi-asserted-by":"crossref","unstructured":"Delos V, Teissandier D (2014) Minkowski sum of polytopes defined by their vertices. arXiv:1412.2564","DOI":"10.5176\/2251-1911_CMCGS15.39"},{"issue":"4","key":"1120_CR3","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5(4):691\u2013703. https:\/\/doi.org\/10.1137\/0205048","journal-title":"SIAM J Comput"},{"key":"1120_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford Jr","year":"1956","unstructured":"Ford LR Jr, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404. https:\/\/doi.org\/10.4153\/CJM-1956-045-5","journal-title":"Can J Math"},{"key":"1120_CR5","doi-asserted-by":"publisher","unstructured":"Ghrist R, Krishnan S (2013) A topological max-flow-min-cut theorem. In: 2013 IEEE global conference on signal and information processing (GlobalSIP), pp 815\u2013818. https:\/\/doi.org\/10.1109\/GlobalSIP.2013.6737016","DOI":"10.1109\/GlobalSIP.2013.6737016"},{"key":"1120_CR6","unstructured":"Krishnan S (2021) Flow-cut dualities for sheaves on graphs. https:\/\/people.math.osu.edu\/krishnan.118\/papers\/mfmc.pdf, last Accessed 18 Sep 2021"},{"issue":"6","key":"1120_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton T, Rao S (1999) Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J ACM 46(6):787\u2013832. https:\/\/doi.org\/10.1145\/331524.331526","journal-title":"J ACM"},{"key":"1120_CR8","unstructured":"nLab authors. Flat Module. http:\/\/ncatlab.org\/nlab\/show\/flat+module, March 2021. Revision 29"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01120-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01120-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01120-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:09:22Z","timestamp":1715951362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01120-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1120"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01120-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,4,11]]},"assertion":[{"value":"21 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial competing interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"54"}}