{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:42:28Z","timestamp":1770741748066,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:00:00Z","timestamp":1643500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:00:00Z","timestamp":1643500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-17-CE40-0015"],"award-info":[{"award-number":["ANR-17-CE40-0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"PGMO","award":["Matrices Totalement Equimodulaires"],"award-info":[{"award-number":["Matrices Totalement Equimodulaires"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10107-021-01743-x","type":"journal-article","created":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:03:06Z","timestamp":1643500986000},"page":"307-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Box-total dual integrality and edge-connectivity"],"prefix":"10.1007","volume":"197","author":[{"given":"Michele","family":"Barbato","sequence":"first","affiliation":[]},{"given":"Roland","family":"Grappe","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Lacroix","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7416-867X","authenticated-orcid":false,"given":"Emiliano","family":"Lancini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,30]]},"reference":[{"issue":"2","key":"1743_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/moor.25.2.243.12223","volume":"25","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Barahona, F., Mahjoub, A.R.: Separation of partition inequalities. Math. Oper. Res. 25(2), 243\u2013254 (2000)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"1743_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0012-365X(94)00255-H","volume":"147","author":"F Barahona","year":"1995","unstructured":"Barahona, F., Mahjoub, A.R.: On two-connected subgraph polytopes. Discrete Math. 147(1\u20133), 19\u201334 (1995)","journal-title":"Discrete Math."},{"key":"1743_CR3","unstructured":"Barbato, M., Grappe, R., Lacroix, M., Lancini, E., Wolfler Calvo, R.: The Schrijver system of the flow cone in series-parallel graphs. Discrete Appl. Math. (2020)"},{"issue":"1","key":"1743_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.20310","volume":"55","author":"F Bendali","year":"2010","unstructured":"Bendali, F., Diarrassouba, I., Mahjoub, A.R., Didi Biha, M., Mailfert, J.: A branch-and-cut algorithm for the $$k$$-edge connected subgraph problem. Networks 55(1), 13\u201332 (2010)","journal-title":"Networks"},{"issue":"4","key":"1743_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1137\/0406047","volume":"6","author":"SC Boyd","year":"1993","unstructured":"Boyd, S.C., Hao, T.: An integer polytope related to the design of survivable communication networks. SIAM J. Discrete Math. 6(4), 612\u2013630 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1743_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/moor.1070.0306","volume":"33","author":"X Chen","year":"2008","unstructured":"Chen, X., Ding, G., Zang, W.: A characterization of box-Mengerian matroid ports. Math. Oper. Res. 33(2), 497\u2013512 (2008)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1743_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.dam.2008.05.001","volume":"157","author":"X Chen","year":"2009","unstructured":"Chen, X., Ding, G., Zang, W.: The box-TDI system associated with 2-edge connected spanning subgraphs. Discrete Appl. Math. 157(1), 118\u2013125 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1743_CR8","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1137\/S009753979833920X","volume":"30","author":"J Cheriyan","year":"2000","unstructured":"Cheriyan, J., Thurimella, R.: Approximating minimum-size $$k$$-connected spanning subgraphs via matching. SIAM J. Comput. 30(2), 528\u2013560 (2000)","journal-title":"SIAM J. Comput."},{"key":"1743_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-020-01514-0","volume":"188","author":"P Chervet","year":"2021","unstructured":"Chervet, P., Grappe, R., Robert, L.H.: Box-total dual integrality, box-integrality, and equimodular matrices. Math. Program. 188, 319\u2013349 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"1743_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S0895480191222665","volume":"7","author":"S Chopra","year":"1994","unstructured":"Chopra, S.: The $$k$$-edge-connected spanning subgraph polyhedron. SIAM J. Discrete Math. 7(2), 245\u2013259 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"9","key":"1743_CR11","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/0305-0548(94)00076-K","volume":"22","author":"LW Clarke","year":"1995","unstructured":"Clarke, L.W., Anandalingam, G.: A bootstrap heuristic for designing minimum cost survivable networks. Comput. Oper. Res. 22(9), 921\u2013934 (1995)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1743_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01582162","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W.: On box totally dual integral polyhedra. Math. Program. 34(1), 48\u201361 (1986)","journal-title":"Math. Program."},{"issue":"17","key":"1743_CR13","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1016\/j.disc.2011.05.025","volume":"311","author":"D Cornaz","year":"2011","unstructured":"Cornaz, D.: Max-multiflow\/min-multicut for $${G}+{H}$$ series-parallel. Discrete Math. 311(17), 1957\u20131967 (2011)","journal-title":"Discrete Math."},{"key":"1743_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.disopt.2018.09.003","volume":"31","author":"D Cornaz","year":"2019","unstructured":"Cornaz, D., Grappe, R., Lacroix, M.: Trader multiflow and box-TDI systems in series-parallel graphs. Discrete Optim. 31, 103\u2013114 (2019)","journal-title":"Discrete Optim."},{"key":"1743_CR15","doi-asserted-by":"crossref","unstructured":"Cornaz, D., Magnouche, Y., Mahjoub, A.R.: On minimal two-edge-connected graphs. In: International Conference on Control, Decision and Information Technologies (CoDIT), pp. 251\u2013256. IEEE (2014)","DOI":"10.1109\/CoDIT.2014.6996902"},{"issue":"1","key":"1743_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33(1), 1\u201327 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"1743_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0167-6377(96)00015-6","volume":"19","author":"M Didi Biha","year":"1996","unstructured":"Didi Biha, M., Mahjoub, A.R.: $$k$$-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. 19(2), 71\u201378 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1743_CR18","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/moor.2017.0852","volume":"43","author":"G Ding","year":"2017","unstructured":"Ding, G., Tan, L., Zang, W.: When is the matching polytope box-totally dual integral? Math. Oper. Res. 43(1), 64\u201399 (2017)","journal-title":"Math. Oper. Res."},{"key":"1743_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jctb.2017.07.001","volume":"128","author":"G Ding","year":"2018","unstructured":"Ding, G., Zang, W., Zhao, Q.: On box-perfect graphs. J. Comb. Theory Ser. B 128, 17\u201346 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1743_CR20","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series\u2013parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"125\u2013130","key":"1743_CR21","first-page":"55","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Natl. Bur. Stand. B 69(125\u2013130), 55\u201356 (1965)","journal-title":"J. Res. Natl. Bur. Stand. B"},{"key":"1743_CR22","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Giles, R.: A min\u2013max relation for submodular functions on graphs. In: Annals of Discrete Mathematics, vol.\u00a01, pp. 185\u2013204. Elsevier (1977)","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"1743_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/B978-0-12-566780-7.50013-1","volume-title":"Progress in Combinatorial Optimization","author":"J Edmonds","year":"1984","unstructured":"Edmonds, J., Giles, R.: Total dual integrality of linear inequality systems. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 117\u2013129. Academic Press, Cambridge (1984)"},{"issue":"4","key":"1743_CR24","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"RE Erickson","year":"1987","unstructured":"Erickson, R.E., Monma, C.L., Veinott, A.F., Jr.: Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12(4), 634\u2013664 (1987)","journal-title":"Math. Oper. Res."},{"issue":"2\u20133","key":"1743_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10107-005-0654-8","volume":"105","author":"J Fonlupt","year":"2006","unstructured":"Fonlupt, J., Mahjoub, A.R.: Critical extreme points of the 2-edge connected spanning subgraph polytope. Math. Program. 105(2\u20133), 289\u2013310 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"1743_CR26","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/net.20289","volume":"53","author":"HN Gabow","year":"2009","unstructured":"Gabow, H.N., Goemans, M.X., Tardos, \u00c9., Williamson, D.P.: Approximating the smallest $$k$$-edge connected spanning subgraph by LP-rounding. Netw.: Int. J. 53(4), 345\u2013357 (2009)","journal-title":"Netw.: Int. J."},{"key":"1743_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"1743_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","volume":"25","author":"FR Giles","year":"1979","unstructured":"Giles, F.R., Pulleyblank, W.R.: Total dual integrality and integer polyhedra. Linear Algebra Appl. 25, 191\u2013196 (1979)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1743_CR29","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Monma, C.L.: Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Discrete Math. 3(4), 502\u2013523 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1743_CR30","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/opre.40.2.309","volume":"40","author":"M Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40(2), 309\u2013330 (1992)","journal-title":"Oper. Res."},{"key":"1743_CR31","unstructured":"Lancini, E.: TDIness and multicuts. Universit\u00e9 Sorbonne, Paris Nord (2019). Ph.D. thesis"},{"issue":"1\u20133","key":"1743_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"AR Mahjoub","year":"1994","unstructured":"Mahjoub, A.R.: Two-edge connected spanning subgraphs and polyhedra. Math. Program. 64(1\u20133), 199\u2013208 (1994)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1743_CR33","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0012-365X(96)00004-0","volume":"170","author":"AR Mahjoub","year":"1997","unstructured":"Mahjoub, A.R.: On perfectly two-edge connected graphs. Discrete Math. 170(1\u20133), 153\u2013172 (1997)","journal-title":"Discrete Math."},{"key":"1743_CR34","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1998)"},{"issue":"4","key":"1743_CR35","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10878-005-1777-9","volume":"9","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.L.: The 2-edge-connected subgraph polyhedron. J. Comb. Optim. 9(4), 357\u2013379 (2005)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"1743_CR36","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0196-6774(86)90018-0","volume":"7","author":"P Winter","year":"1986","unstructured":"Winter, P.: Generalized Steiner problem in series\u2013parallel networks. J. Algorithms 7(4), 549\u2013566 (1986)","journal-title":"J. Algorithms"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01743-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01743-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01743-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:07:21Z","timestamp":1674349641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01743-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,30]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1743"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01743-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,30]]},"assertion":[{"value":"15 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}