{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:16:43Z","timestamp":1781345803355,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2021-02475"],"award-info":[{"award-number":["RGPIN-2021-02475"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006188","name":"Einstein Foundation Berlin","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006188","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10107-023-01971-3","type":"journal-article","created":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T11:02:07Z","timestamp":1684321327000},"page":"677-702","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A colorful Steinitz Lemma with application to block-structured integer programs"],"prefix":"10.1007","volume":"204","author":[{"given":"Timm","family":"Oertel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2930-3155","authenticated-orcid":false,"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,17]]},"reference":[{"issue":"1\u20132","key":"1971_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-019-01392-1","volume":"182","author":"I Aliev","year":"2020","unstructured":"Aliev, I., Henk, M., Oertel, T.: Distances to lattice points in knapsack polyhedra. Math. Progr. 182(1\u20132), 175\u2013198 (2020)","journal-title":"Math. Progr."},{"key":"1971_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.laa.2016.02.035","volume":"499","author":"G Ambrus","year":"2015","unstructured":"Ambrus, G., B\u00e1r\u00e1ny, I., Grinberg, V.S.: Small subset sums. Linear Algebra Appl. 499, 66\u201378 (2015)","journal-title":"Linear Algebra Appl."},{"key":"1971_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1090\/conm\/685\/13718","volume":"685","author":"N Amenta","year":"2017","unstructured":"Amenta, N., De Loera, J.A., Sober\u00f3n, P.: Helly\u2019s theorem: new variations and applications. Algebraic Geom. Methods Discret. Math. 685, 55\u201395 (2017)","journal-title":"Algebraic Geom. Methods Discret. Math."},{"key":"1971_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(82)90115-7","volume":"40","author":"I B\u00e1r\u00e1ny","year":"1982","unstructured":"B\u00e1r\u00e1ny, I.: A generalization of Carath\u00e9odory\u2019s theorem. Discret. Math. 40, 141\u2013152 (1982)","journal-title":"Discret. Math."},{"key":"1971_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-011-0474-y","volume":"135","author":"K Bhucin","year":"2012","unstructured":"Bhucin, K., Matou\u0161ek, J., Moser, R.A., Palvoelgyi, D.: Vectors in a box. Math. Program. 135, 323\u2013335 (2012)","journal-title":"Math. Program."},{"key":"1971_CR6","doi-asserted-by":"crossref","unstructured":"Celaya, M., Kuhlmann, S., Paat, J., Weismantel, R.: Improving the Cook et al. proximity bound given integral valued constraints. Available online at arXiv:2111.01782, (2021)","DOI":"10.1007\/978-3-031-06901-7_7"},{"key":"1971_CR7","unstructured":"Chen, L., Chen, H., Zhang, G.: FPT algorithms for a special block-structured integer program with applications in scheduling. Available online at arXiv:2107.01373, (2021)"},{"key":"1971_CR8","unstructured":"Chen, L., Kouteck\u00fd, M., Xu, L. Shi, W.: New bounds on augmenting steps of block-structured integer programs. In: 28th Annual European Symposium on Algorithms (ESA), Editors: F. Grandoni, G. Herman and P. Sanders, pp. 33:1\u201333:19, (2020)"},{"key":"1971_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, \u00c9.: Sensitivity theorems in integer linear programming. Math. Program. 34, 251\u2013264 (1986)","journal-title":"Math. Program."},{"key":"1971_CR10","doi-asserted-by":"crossref","unstructured":"Cslovjecsek, J., Eisenbrand, F., Hunkenschr\u00f6der, C., Rohwedder, L., Weismantel, R.: Block-structured integer and linear programming in strongly polynomial and near linear time. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1666\u20131681, (2021)","DOI":"10.1137\/1.9781611976465.101"},{"key":"1971_CR11","unstructured":"Cslovjecsek, J., Eisenbrand, F., Pilipczuk, M., Venzin, M., Weismantel, R.: Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. 29th Annual European Symposium on Algorithms (ESA 2021), pp. 33:1\u201333:14, (2021)"},{"key":"1971_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-010-0384-4","volume":"132","author":"S Dash","year":"2012","unstructured":"Dash, S., Fukasawa, R., G\u00fcnl\u00fck, O.: The master equality polyhedron with multiple rows. Math. Program. 132, 125\u2013151 (2012)","journal-title":"Math. Program."},{"key":"1971_CR13","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K-M.: Faster algorithms for integer programs with block structure. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), I. Chatzigiannakis, C. Kaklamanis, D. Marx, and D. Sannella (eds), pp. 49:1-49:13 (2018)"},{"key":"1971_CR14","unstructured":"Eisenbrand, F., Hunkenschr\u00f3der, C., Klein, K.M., Kouteck\u00fd, M., Levin, A., Onn, S.: An Algorithmic Theory of Integer Programming. Available online: arXiv:1904.01361, (2019)"},{"key":"1971_CR15","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 808\u2013816, (2018)","DOI":"10.1137\/1.9781611975031.52"},{"issue":"2","key":"1971_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01086559","volume":"14","author":"V S Grinberg","year":"1980","unstructured":"Grinberg, V. S., Sevast\u2019yanov, S. V.: Value of the Steinitz constant. Funct. Anal. Appl. 14(2), 125\u2013126 (1980). https:\/\/doi.org\/10.1007\/BF01086559","journal-title":"Funct. Anal. Appl."},{"key":"1971_CR17","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"issue":"2","key":"1971_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2006.06.006","volume":"5","author":"R Hemmecke","year":"2008","unstructured":"Hemmecke, R., De Loera, J., Onn, S., Weismantel, R.: N-fold integer programming. Discret. Optim. 5(2), 231\u2013241 (2008). https:\/\/doi.org\/10.1016\/j.disopt.2006.06.006","journal-title":"Discret. Optim."},{"key":"1971_CR19","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs. In Proceedings of 2010 International Conference on Integer Programming and Combinatorial Optimziation, pages 219\u2013229, (2018)","DOI":"10.1007\/978-3-642-13036-6_17"},{"issue":"1\u20132","key":"1971_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-011-0490-y","volume":"137","author":"Raymond Hemmecke","year":"2013","unstructured":"Hemmecke, Raymond, Onn, Shmuel, Romanchuk, Lyubov: n-Fold integer programming in cubic time. Math. Program. 137(1\u20132), 325\u2013341 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0490-y","journal-title":"Math. Program."},{"key":"1971_CR21","doi-asserted-by":"crossref","unstructured":"Jansen, K., Klein, K.M., Maack, M., Rau, M.: Empowering the configuration-IP: new PTAS results for scheduling with setup times. Mathematical Programming, (2021)","DOI":"10.1007\/s10107-021-01694-3"},{"key":"1971_CR22","unstructured":"Jansen, K., Rohwedder, L.: On integer programming and convolution. In 10th Innovations in Theoretical Computer Science (ITCS 2019), pp. 43:1\u201343:7, (2018)"},{"key":"1971_CR23","doi-asserted-by":"crossref","unstructured":"Klein, K.M.: About the complexity of two-stage stochastic IPs. Mathematical Programming, (2021)","DOI":"10.1007\/978-3-030-45771-6_20"},{"key":"1971_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01402-2","volume":"184","author":"D Knop","year":"2020","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Combinatorial n-fold integer programming and applications. Math. Program. 184, 1\u201334 (2020)","journal-title":"Math. Program."},{"key":"1971_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3396855","volume":"8","author":"D Knop","year":"2020","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Voting and bribing in single-exponential time. ACM Trans. Econ. Comput. 8, 1\u201328 (2020)","journal-title":"ACM Trans. Econ. Comput."},{"key":"1971_CR26","unstructured":"Kouteck\u00fd, M., Levin, A., Onn, S.: A parameterized strongly polynomial algorithm for block structured integer programs. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), C. Baier, I. Chatzigiannakis, P. Flocchini, and S. Leonardi (eds), pp. 85:1\u201385:14, (2018)"},{"key":"1971_CR27","doi-asserted-by":"crossref","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Improving proximity bounds using sparsity. M.BaI\u0308ou, B. Gendron, O. G\u00fcnl\u00fck, and A.R. Mahjoub (eds) Combinatorial Optimization. ISCO 2020. Lecture Notes in Computer Science, pp. 12176:115\u2013127, (2020)","DOI":"10.1007\/978-3-030-53262-8_10"},{"key":"1971_CR28","doi-asserted-by":"crossref","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Polynomial upper bounds on the number of differing columns of $$\\Delta $$-modular integer programs. arXiv:2105.08160, (2021)","DOI":"10.1287\/moor.2022.1339"},{"key":"1971_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10107-018-1323-z","volume":"179","author":"J Paat","year":"2018","unstructured":"Paat, J., Weismantel, R., Weltge, S.: Distances between optimal solutions of mixed-integer programs. Math. Program. 179, 455\u2013468 (2018)","journal-title":"Math. Program."},{"key":"1971_CR30","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R Schultz","year":"1996","unstructured":"Schultz, R., Stougie, L., Vlerk, V.: Two-stage stochastic integer programming\u202f: a survey. Stat. Neerl. 50, 404\u2013416 (1996)","journal-title":"Stat. Neerl."},{"key":"1971_CR31","doi-asserted-by":"crossref","unstructured":"Steinitz, E.: Bedingt konvergente reihen und konvexe systeme. Journal f\u00fcr die reine und angewandte Mathematik, pp. 128\u2013176, (1913)","DOI":"10.1515\/crll.1913.143.128"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01971-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01971-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T23:39:24Z","timestamp":1708299564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01971-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1971"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01971-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,17]]},"assertion":[{"value":"15 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}