{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:35:13Z","timestamp":1742978113834,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532611"},{"type":"electronic","value":"9783030532628"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53262-8_3","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"27-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Michele","family":"Barbato","sequence":"first","affiliation":[]},{"given":"Roland","family":"Grappe","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Lacroix","sequence":"additional","affiliation":[]},{"given":"Emiliano","family":"Lancini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"issue":"2","key":"3_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":"3_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":"3_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":"4","key":"3_CR4","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":"3_CR5","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":"3_CR6","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."},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Chervet, P., Grappe, R., Robert, L.: Box-total dual integrality, box-integrality, and equimodular matrices. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01514-0","DOI":"10.1007\/s10107-020-01514-0"},{"issue":"2","key":"3_CR8","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":"3_CR9","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":"3_CR10","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."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Cornaz, D., Magnouche, Y., Mahjoub, A.R.: On minimal two-edge-connected graphs. In: 2014 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 251\u2013256. IEEE (2014)","DOI":"10.1109\/CoDIT.2014.6996902"},{"key":"3_CR12","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."},{"issue":"1","key":"3_CR13","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."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0121194","volume-title":"Polyhedral Combinatorics","author":"WH Cunningham","year":"1978","unstructured":"Cunningham, W.H., Marsh, A.B.: A primal algorithm for optimum matching. In: Balinski, M.L., Hoffman, A.J. (eds.) Polyhedral Combinatorics, pp. 50\u201372. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0121194"},{"issue":"2","key":"3_CR15","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":"3_CR16","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":"3_CR17","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":"3_CR18","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-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. In: Annals of Discrete Mathematics, vol. 1, pp. 185\u2013204. Elsevier (1977)","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Giles, R.: Total dual integrality of linear inequality systems. In: Progress in Combinatorial Optimization, pp. 117\u2013129. Academic Press (1984). ISBN 978-0-12-566780-7","DOI":"10.1016\/B978-0-12-566780-7.50013-1"},{"issue":"4","key":"3_CR21","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 Jr., A.F.: 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":"3_CR22","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":"3_CR23","first-page":"345","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":"3_CR24","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). ISBN 0716710447"},{"key":"3_CR25","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":"3_CR26","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":"3_CR27","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":"3_CR28","unstructured":"Lancini, E.: TDIness and Multicuts. Ph.D. thesis, Universit\u00e9 Sorbonne Paris Nord (2019)"},{"issue":"1\u20133","key":"3_CR29","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":"3_CR30","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":"3_CR31","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"issue":"4","key":"3_CR32","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":"3_CR33","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-parallel networks. J. Algorithms 7(4), 549\u2013566 (1986)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:08:18Z","timestamp":1710266898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.26","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}