{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:40:10Z","timestamp":1750156810488,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-21-1-0233"],"award-info":[{"award-number":["FA9550-21-1-0233"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2006183"],"award-info":[{"award-number":["2006183"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s11590-025-02198-1","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T12:17:46Z","timestamp":1746706666000},"page":"1053-1074","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the diameter of a 2-sum of polyhedra"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8069-5046","authenticated-orcid":false,"given":"Steffen","family":"Borgwardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weston","family":"Grewe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"key":"2198_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179","volume-title":"Linear Programming and Extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton, NJ (1963)"},{"key":"2198_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02395040","volume":"133","author":"V Klee","year":"1967","unstructured":"Klee, V., Walkup, D.W.: The $$d$$-step conjecture for polyhedra of dimension $$d < 6$$. Acta Math. 133, 53\u201378 (1967)","journal-title":"Acta Math."},{"issue":"1","key":"2198_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.4007\/annals.2012.176.1.7","volume":"176","author":"F Santos","year":"2011","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture. Ann. Math. 176(1), 383\u2013412 (2011)","journal-title":"Ann. Math."},{"issue":"2","key":"2198_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1090\/S0273-0979-1992-00285-9","volume":"26","author":"G Kalai","year":"1992","unstructured":"Kalai, G., Kleitman, D.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Am. Math. Soc. 26(2), 315\u2013316 (1992)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"2198_CR5","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1137\/140962310","volume":"28","author":"MJ Todd","year":"2014","unstructured":"Todd, M.J.: An improved Kalai-Kleitman bound for the diameter of a polyhedron. SIAM J. Discret. Math. 28(4), 1944\u20131947 (2014)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"2198_CR6","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00454-018-0016-y","volume":"62","author":"N Sukegawa","year":"2019","unstructured":"Sukegawa, N.: An asymptotically improved upper bound on the diameter of polyhedra. Discrete Comput. Geometry 62(3), 690\u2013699 (2019)","journal-title":"Discrete Comput. Geometry"},{"issue":"1","key":"2198_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00454-014-9601-x","volume":"52","author":"N Bonifas","year":"2014","unstructured":"Bonifas, N., Di Summa, M., Eisenbrand, F., H\u00e4hnle, N., Niemeier, M.: On sub-determinants and the diameter of polyhedra. Discrete Comput. Geometry 52(1), 102\u2013115 (2014)","journal-title":"Discrete Comput. Geometry"},{"key":"2198_CR8","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, New York, NY (1998)"},{"issue":"3","key":"2198_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Combinat. Theory, Ser. B 28(3), 305\u2013359 (1980)","journal-title":"J. Combinat. Theory, Ser. B"},{"key":"2198_CR10","doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 1206\u20131219, (2017)","DOI":"10.1145\/3055399.3055473"},{"issue":"1","key":"2198_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1137\/22M1490508","volume":"38","author":"S Borgwardt","year":"2024","unstructured":"Borgwardt, S., Grewe, W., Lee, J.: On the combinatorial diameters of parallel and series connections. SIAM J. Discret. Math. 38(1), 485\u2013503 (2024)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"2198_CR12","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1137\/1016083","volume":"16","author":"M Balinski","year":"1974","unstructured":"Balinski, M., Russakoff, A.: On the assignment polytope. SIAM Rev. 16(4), 516\u2013525 (1974)","journal-title":"SIAM Rev."},{"issue":"1","key":"2198_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-011-0504-9","volume":"141","author":"S Borgwardt","year":"2013","unstructured":"Borgwardt, S.: On the diameter of partition polytopes and vertex-disjoint cycle cover. Math. Program. 141(1), 1\u201320 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2198_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-017-1176-x","volume":"171","author":"S Borgwardt","year":"2018","unstructured":"Borgwardt, S., De Loera, J.A., Finhold, E.: The diameters of network-flow polytopes satisfy the Hirsch conjecture. Math. Program. 171(1\u20132), 283\u2013309 (2018)","journal-title":"Math. Program."},{"key":"2198_CR15","unstructured":"K. Truemper. Matroid Decomposition. Academic Press, (1992). Revised, 2009. https:\/\/www.emis.de\/monographs\/md\/"},{"key":"2198_CR16","volume-title":"Matroid Theory","author":"J Oxley","year":"2006","unstructured":"Oxley, J.: Matroid Theory. Oxford University Press, Oxford (2006)"},{"key":"2198_CR17","unstructured":"V.A. Yemelichev, M.M. Koval\u00ebv, and M.K. Kravtsov. Polytopes, Graphs and Optimisation. Cambridge University Press, Cambridge, UK. Translated from the Russian by G.H. Lawden (1984)"},{"key":"2198_CR18","unstructured":"W. Grewe. On Short Combinatorial Walks. PhD Thesis, University of Colorado Denver, (2024)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02198-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-025-02198-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02198-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:08:03Z","timestamp":1750154883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-025-02198-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2198"],"URL":"https:\/\/doi.org\/10.1007\/s11590-025-02198-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"25 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}