{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T17:46:55Z","timestamp":1744307215506,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_28","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"393-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Advances on\u00a0Strictly $$\\varDelta $$-Modular IPs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3059-6402","authenticated-orcid":false,"given":"Martin","family":"N\u00e4gele","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6864-1953","authenticated-orcid":false,"given":"Christian","family":"N\u00f6bel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3515-4953","authenticated-orcid":false,"given":"Richard","family":"Santiago","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7148-9304","authenticated-orcid":false,"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1287\/moor.2021.1137","volume":"47","author":"M Aprile","year":"2021","unstructured":"Aprile, M., Fiorini, S.: Regular matroids have polynomial extension complexity. Math. Oper. Res. 47(1), 540\u2013559 (2021). https:\/\/doi.org\/10.1287\/moor.2021.1137","journal-title":"Math. Oper. Res."},{"issue":"5","key":"28_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.orl.2016.07.004","volume":"44","author":"S Artmann","year":"2016","unstructured":"Artmann, S., Eisenbrand, F., Glanzer, C., Oertel, T., Vempala, S., Weismantel, R.: A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44(5), 635\u2013639 (2016). https:\/\/doi.org\/10.1016\/j.orl.2016.07.004","journal-title":"Oper. Res. Lett."},{"key":"28_CR3","doi-asserted-by":"publisher","unstructured":"Artmann, S., Weismantel, R., and Zenklusen, R.: A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC \u201917), pp. 1206\u20131219, Montreal (2017). https:\/\/doi.org\/10.1145\/3055399.3055473","DOI":"10.1145\/3055399.3055473"},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Averkov, G., Schymura, M.: On the Maximal Number of Columns of a $$\\varDelta $$ - modular Matrix. In: Proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization (IPCO \u201922), pp. 29\u201342, Eidhoven (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_3","DOI":"10.1007\/978-3-031-06901-7_3"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0012-365X(87)90097-5","volume":"66","author":"F Barahona","year":"1987","unstructured":"Barahona, F., Conforti, M.: A construction for binary matroids. Discret. Math. 66(3), 213\u2013218 (1987). https:\/\/doi.org\/10.1016\/0012-365X(87)90097-5","journal-title":"Discret. Math."},{"issue":"1","key":"28_CR6","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). https:\/\/doi.org\/10.1007\/s00454-014-9601-x","journal-title":"Discrete Comput. Geometry"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0196-6774(92)90018-8","volume":"13","author":"PM Camerini","year":"1992","unstructured":"Camerini, P.M., Galbiati, G., Maffioli, F.: Random pseudo-polynomial algorithms for exact matroid problems. J. Algorithms 13, 258\u2013273 (1992). https:\/\/doi.org\/10.1016\/0196-6774(92)90018-8","journal-title":"J. Algorithms"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Di Summa, M., Eisenbrand, F., Faenza, Y., Moldenhauer, C.: On Largest Volume Simplices and Sub-determinants. In: Proceedings of the 26th Annual ACMSIAM Symposium on Discrete Algorithms (SODA \u201915), pp. 315\u2013323, San Diego (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.23","DOI":"10.1137\/1.9781611973730.23"},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1137\/13094030X","volume":"43","author":"M Dinitz","year":"2014","unstructured":"Dinitz, M., Kortsarz, G.: Matroid secretary for regular and decomposable matroids. SIAM J. Comput. 43(5), 1807\u20131830 (2014). https:\/\/doi.org\/10.1137\/13094030X","journal-title":"SIAM J. Comput."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-016-1089-0","volume":"1","author":"F Eisenbrand","year":"2016","unstructured":"Eisenbrand, F., Vempala, S.: Geometric random edge. Math. Program. 1, 325\u2013339 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1089-0","journal-title":"Math. Program."},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Fiorini, S., Joret, G., Weltge, S., and Yuditsky, Y.: Integer programs with bounded subdeterminants and two nonzeros per row. In: Proceedings of the 62nd Annual Symposium on Foundations of Computer Science (FOCS \u201922), pp. 13\u201324 (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00011","DOI":"10.1109\/FOCS52979.2021.00011"},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Glanzer, C., Stallknecht, I., and Weismantel, R.: On the recognition of a, b, c- modular matrices. In: Proceedings of the 22nd International Conference on Integer Programming and Combinatorial Optimization (IPCO \u201921), pp. 238\u2013251, Atlanta (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_17","DOI":"10.1007\/978-3-030-73879-2_17"},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1137\/17M1125728","volume":"32","author":"C Glanzer","year":"2018","unstructured":"Glanzer, C., Weismantel, R., Zenklusen, R.: On the number of distinct rows of a matrix with bounded subdeterminants. SIAM J. Discret. Math. 32(3), 1706\u20131720 (2018). https:\/\/doi.org\/10.1137\/17M1125728","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"28_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF01192523","volume":"15","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Ramakrishnan, V.S.: Minimizing submodular functions over families of sets. Combinatorica 15(4), 499\u2013513 (1995). https:\/\/doi.org\/10.1007\/BF01192523","journal-title":"Combinatorica"},{"key":"28_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-022-01165-9","author":"D Gribanov","year":"2022","unstructured":"Gribanov, D., Shumilov, I., Malyshev, D., Pardalos, P.: On $$\\varDelta $$-modular integer linear problems in the canonical form and equivalent problems. J. Global Optim. (2022). https:\/\/doi.org\/10.1007\/s10898-022-01165-9","journal-title":"J. Global Optim."},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Gribanov, D.V.: An FPTAS for the $$\\varDelta $$-modular multidimensional knapsack problem. In: Proceedings of the International Conference on Mathematical Optimization Theory and Operations Research (MOTOR), pp. 79\u201395 (2021). https:\/\/doi.org\/10.1007\/978-3-030-77876-7_6","DOI":"10.1007\/978-3-030-77876-7_6"},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"Gribanov, D.V., Zolotykh, N.Y.: On lattice point counting in $$\\varDelta $$-modular polyhedra. Optim. Lett. (1), 1\u201328 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01744-x","DOI":"10.1007\/s11590-021-01744-x"},{"issue":"6","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11590-015-0943-y","volume":"10","author":"DV Gribanov","year":"2015","unstructured":"Gribanov, D.V., Veselov, S.I.: On integer programming with bounded determinants. Optim. Lett. 10(6), 1169\u20131177 (2015). https:\/\/doi.org\/10.1007\/s11590-015-0943-y","journal-title":"Optim. Lett."},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02579139","volume":"4","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Corrigendum to our paper \u2018The ellipsoid method and its consequences in combinatorial optimization\u2019. Combinatorica 4(4), 291\u2013295 (1984). https:\/\/doi.org\/10.1007\/BF02579139","journal-title":"Combinatorica"},{"key":"28_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Cham (1993). https:\/\/doi.org\/10.1007\/978-3-642-78240-4"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.2140\/pjm.1957.7.1351","volume":"7","author":"I Heller","year":"1957","unstructured":"Heller, I.: On linear systems with integral valued solutions. Pac. J. Math. 7(3), 1351\u20131364 (1957). https:\/\/doi.org\/10.2140\/pjm.1957.7.1351","journal-title":"Pac. J. Math."},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-53262-8_10","volume-title":"Combinatorial Optimization","author":"J Lee","year":"2020","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Improving proximity bounds using sparsity. In: Ba\u00efou, M., Gendron, B., G\u00fcnl\u00fck, O., Mahjoub, A.R. (eds.) ISCO 2020. LNCS, vol. 12176, pp. 115\u2013127. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53262-8_10"},{"key":"28_CR23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1339","author":"J Lee","year":"2022","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Polynomial upper bounds on the number of differing columns of $$\\varDelta $$-modular integer programs. Math. Oper. Res. (2022). https:\/\/doi.org\/10.1287\/moor.2022.1339","journal-title":"Math. Oper. Res."},{"key":"28_CR24","doi-asserted-by":"publisher","unstructured":"N\u00e4gele, M., Santiago, R., Zenklusen, R.: Congruency-constrained TU problems beyond the bimodular case. In: Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 2743\u20132790 (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.108","DOI":"10.1137\/1.9781611977073.108"},{"issue":"6","key":"28_CR25","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s00493-019-3900-1","volume":"39","author":"M N\u00e4gele","year":"2019","unstructured":"N\u00e4gele, M., Sudakov, B., Zenklusen, R.: Submodular minimization under congruency constraints. Combinatorica 39(6), 1351\u20131386 (2019). https:\/\/doi.org\/10.1007\/s00493-019-3900-1","journal-title":"Combinatorica"},{"key":"28_CR26","doi-asserted-by":"publisher","unstructured":"N\u00e4gele, M., Zenklusen, R.: A new contraction technique with applications to congruency-constrained cuts. Math. Program. (6), 455\u2013481 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01498-x","DOI":"10.1007\/s10107-020-01498-x"},{"key":"28_CR27","doi-asserted-by":"publisher","unstructured":"Nikolov, A.: Randomized rounding for the largest simplex problem. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC 2015), pp. 861\u2013870, Portland (2015). https:\/\/doi.org\/10.1145\/2746539.2746628","DOI":"10.1145\/2746539.2746628"},{"key":"28_CR28","doi-asserted-by":"publisher","unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: The integrality number of an integer program. Math. Program. (6), 1\u201321 (2021). https:\/\/doi.org\/10.1007\/s10107-021-01651-0","DOI":"10.1007\/s10107-021-01651-0"},{"issue":"1","key":"28_CR29","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"MW Padberg","year":"1982","unstructured":"Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7(1), 67\u201380 (1982). https:\/\/doi.org\/10.1287\/moor.7.1.67","journal-title":"Math. Oper. Res."},{"key":"28_CR30","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"issue":"3","key":"28_CR31","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. Comb. Theory, Ser. B 28(3), 305\u2013359 (1980). https:\/\/doi.org\/10.1016\/0095-8956(80)90075-1","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"28_CR32","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.25","volume":"34","author":"\u00c9 Tardos","year":"1986","unstructured":"Tardos, \u00c9.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250\u2013256 (1986). https:\/\/doi.org\/10.1287\/opre.34.2.25","journal-title":"Oper. Res."},{"issue":"2","key":"28_CR33","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"SI Veselov","year":"2009","unstructured":"Veselov, S.I., Chirkov, A.J.: Integer program with bimodular matrix. Discret. Optim. 6(2), 220\u2013222 (2009). https:\/\/doi.org\/10.1016\/j.disopt.2008.12.002","journal-title":"Discret. Optim."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:31:17Z","timestamp":1684701077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"33","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":"28% - 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":"3","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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}