{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:33Z","timestamp":1772120133852,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Russian Science Foundation,Russia","award":["21-11-00194"],"award-info":[{"award-number":["21-11-00194"]}]},{"name":"Russian Science Foundation,Russia","award":["21-11-00194"],"award-info":[{"award-number":["21-11-00194"]}]},{"name":"Russian Science Foundation,Russia","award":["21-11-00194"],"award-info":[{"award-number":["21-11-00194"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00310-2","type":"journal-article","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T07:01:41Z","timestamp":1712214101000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a Simple Connection Between $$\\Delta$$-Modular ILP and LP, and a New Bound on the Number of Integer Vertices"],"prefix":"10.1007","volume":"5","author":[{"given":"Dmitry","family":"Gribanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Malyshev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Shumilov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,4]]},"reference":[{"key":"310_CR1","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1007\/s10878-018-0264-z","volume":"35","author":"VD Gribanov","year":"2018","unstructured":"Gribanov VD, Malyshev SD, Pardalos MP, Veselov IS (2018) FPT-algorithms for some problems related to integer programming. J Comb Optim 35:1128\u20131146. https:\/\/doi.org\/10.1007\/s10878-018-0264-z","journal-title":"J Comb Optim"},{"key":"310_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-022-01165-9","author":"VD Gribanov","year":"2022","unstructured":"Gribanov VD, Shumilov AI, Malyshev SD, Pardalos MP (2022) On $$\\delta$$-modular integer linear problems in the canonical form and equivalent problems. J Glob Optim. https:\/\/doi.org\/10.1007\/s10898-022-01165-9","journal-title":"J Glob Optim"},{"issue":"2","key":"310_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen P (1970) The maximum numbers of faces of a convex polytope. Mathematika 17(2):179\u2013184. https:\/\/doi.org\/10.1112\/S0025579300002850","journal-title":"Mathematika"},{"key":"310_CR4","volume-title":"Convex polytopes","author":"B Gr\u00fcnbaum","year":"2011","unstructured":"Gr\u00fcnbaum B (2011) Convex polytopes. Graduate Texts in Mathematics. Springer, New York"},{"key":"310_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1134\/S1990478908040157","volume":"2","author":"IS Veselov","year":"2008","unstructured":"Veselov IS, Chirkov YA (2008) Some estimates for the number of vertices of integer polyhedra. J Appl Ind Math 2:591\u2013604. https:\/\/doi.org\/10.1134\/S1990478908040157","journal-title":"J Appl Ind Math"},{"key":"310_CR6","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1007\/s00373-016-1683-1","volume":"32","author":"AY Chirkov","year":"2016","unstructured":"Chirkov AY, Zolotykh NY (2016) On the number of irreducible points in polyhedra. Graphs and Combinatorics 32:1789\u20131803","journal-title":"Graphs and Combinatorics"},{"key":"310_CR7","unstructured":"Zolotykh N (2000) On the number of vertices in integer linear programming problems"},{"key":"310_CR8","unstructured":"Veselov IS, Chirkov YA (2008) On the vertices of implicitly defined integer polyhedra. Vestnik of Lobachevsky University of Nizhni Novgorod 1:118\u2013123. (in Russian)"},{"key":"310_CR9","unstructured":"Chirkov YA, Veselov IS (2008) On the vertices of implicitly defined integer polyhedra (part 2). Vestnik of Lobachevsky University of Nizhni Novgorod 2:166\u2013172. (in Russian)"},{"key":"310_CR10","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver A (1998) Theory of linear and integer programming. John Wiley & Sons, Chichester"},{"issue":"1","key":"310_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"W Cook","year":"1992","unstructured":"Cook W, Hartmann M, Kannan R, McDiarmid C (1992) On integer points in polyhedra. Combinatorica 12(1):27\u201337. https:\/\/doi.org\/10.1007\/BF01191202","journal-title":"Combinatorica"},{"issue":"3","key":"310_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook W, Gerards AMH, Schrijver A, Tardos E (1986) Sensitivity theorems in integer linear programming. Math Program 34(3):251\u2013261. https:\/\/doi.org\/10.1007\/BF01582230","journal-title":"Math Program"},{"issue":"3","key":"310_CR13","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1137\/17M1162792","volume":"28","author":"I Aliev","year":"2018","unstructured":"Aliev I, De Loera JA, Eisenbrand F, Oertel T, Weismantel R (2018) The support of integer optimal solutions. SIAM J Optim 28(3):2152\u20132157. https:\/\/doi.org\/10.1137\/17M1162792","journal-title":"SIAM J Optim"},{"key":"310_CR14","doi-asserted-by":"publisher","unstructured":"Berndt S, Jansen K, Klein K-M (2021) New bounds for the vertices of the integer hull. 2021 Symposium on Simplicity in Algorithms (SOSA), pp 25\u201336. https:\/\/doi.org\/10.1137\/1.9781611976496.3","DOI":"10.1137\/1.9781611976496.3"},{"key":"310_CR15","doi-asserted-by":"crossref","unstructured":"Brass P (1998) On lattice polyhedra and pseudocircle arrangements. In: Karl der Grosse und Sein Nachwirken. 1200 Jahre Kultur und Wissenschaft in Europa: Band II, Mathematisches Wissen, p 297\u2013302","DOI":"10.1484\/M.STHS-EB.4.2017046"},{"issue":"1\u20133","key":"310_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0012-365X(93)90155-M","volume":"111","author":"P Erd\u00f6s","year":"1993","unstructured":"Erd\u00f6s P, F\u00fcredi Z, Pach J, Ruzsa IZ (1993) The grid revisited. Discrete mathematics 111(1\u20133):189\u2013196","journal-title":"The grid revisited. Discrete mathematics"},{"key":"310_CR17","doi-asserted-by":"crossref","unstructured":"Averkov G, Schymura M (2022) On the maximal number of columns of $$\\delta$$-modular matrix. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 29\u201342. Springer","DOI":"10.1007\/978-3-031-06901-7_3"},{"key":"310_CR18","doi-asserted-by":"crossref","unstructured":"Lee J, Paat J, Stallknecht I, Xu L (2021) Polynomial upper bounds on the number of differing columns of an integer program. arXiv preprint arXiv:2105.08160v2. [math.OC]","DOI":"10.1287\/moor.2022.1339"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00310-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00310-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00310-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T07:10:05Z","timestamp":1719904205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00310-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,4]]},"references-count":18,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["310"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00310-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3320258\/v1","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,4]]},"assertion":[{"value":"2 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}],"article-number":"32"}}