{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:23:19Z","timestamp":1768346599857,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T00:00:00Z","timestamp":1618012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T00:00:00Z","timestamp":1618012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006188","name":"Einstein Stiftung 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":[[2022,3]]},"DOI":"10.1007\/s10107-021-01651-0","type":"journal-article","created":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T10:03:08Z","timestamp":1618048988000},"page":"271-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The integrality number of an integer program"],"prefix":"10.1007","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2930-3155","authenticated-orcid":false,"given":"Joseph","family":"Paat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Schl\u00f6ter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"key":"1651_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1137\/16M1083876","volume":"1","author":"I Aliev","year":"2017","unstructured":"Aliev, I., De Loera, J., Oertel, T., O\u2019Neil, C.: Sparse solutions of linear diophantine equations. SIAM J. Appl. Algebra Geom. 1, 239\u2013253 (2017)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"5","key":"1651_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)","journal-title":"Oper. Res. Lett."},{"key":"1651_CR3","doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1206\u20131219 (2017)","DOI":"10.1145\/3055399.3055473"},{"key":"1651_CR4","doi-asserted-by":"crossref","unstructured":"Bader, J., Hildebrand, R., Weismantel, R., Zenklusen, R.: Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. 1\u201320 (2017)","DOI":"10.1007\/s10107-017-1147-2"},{"key":"1651_CR5","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/054","volume-title":"A Course in Convexity","author":"A Barvinok","year":"2002","unstructured":"Barvinok, A.: A Course in Convexity. Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)"},{"key":"1651_CR6","first-page":"151","volume":"510","author":"W Bruns","year":"2004","unstructured":"Bruns, W., Gubeladze, J.: Normality and covering properties of affine semigroups. J. Reine Angew. Math. 510, 151\u2013178 (2004)","journal-title":"J. Reine Angew. Math."},{"key":"1651_CR7","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Weltge, S., Zenklusen, R.: Lifting linear extension complexity bounds to the mixed-integer setting. In: Proceedings of the 2018 ACM-SIAM Symposium on Discrete Algorithms (2018)","DOI":"10.1137\/1.9781611975031.51"},{"key":"1651_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2014)"},{"key":"1651_CR9","doi-asserted-by":"crossref","unstructured":"Conforti, M., Fiorini, S., Huynh, T., Joret, G., Weltge, S.: The stable set problem in graphs with bounded genus and bounded odd cycle packing number. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (2020)","DOI":"10.1137\/1.9781611975994.176"},{"key":"1651_CR10","doi-asserted-by":"crossref","unstructured":"Conforti, M., Fiorini, S., Huynh, T., Weltge, S.: Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. In: Proceedings of the 2020 International Integer Programming and Combinatorial Optimization (2020)","DOI":"10.1007\/s10107-021-01635-0"},{"key":"1651_CR11","doi-asserted-by":"crossref","unstructured":"Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via M-ellipsoid coverings. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 580\u2013589 (2011)","DOI":"10.1109\/FOCS.2011.31"},{"key":"1651_CR12","doi-asserted-by":"crossref","unstructured":"Di Summa, M., Eisenbrand, F., Faenza, Y., Moldenhauer, C.: On largest volume simplices and sub-determinants. In: Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms of SODA (2015)","DOI":"10.1137\/1.9781611973730.23"},{"key":"1651_CR13","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 2018 ACM-SIAM Symposium on Discrete Algorithms, pp. 808\u2013816 (2018)","DOI":"10.1137\/1.9781611975031.52"},{"key":"1651_CR14","unstructured":"Ghouila-Houri, A.: Caract\u00e9risation des Matrices Totalement Unimodulaires. C.R Academy of Science Paris (1962)"},{"key":"1651_CR15","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. Discrete Math. 32, 1706\u20131720 (2018)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1651_CR16","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"RE Gomory","year":"1965","unstructured":"Gomory, R.E.: On the relation between integer and noninteger solutions to linear programs. Proc. Nat. Acad. Sci. 53(2), 260\u2013265 (1965)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"1651_CR17","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s11590-016-1048-y","volume":"10","author":"D Gribanov","year":"2016","unstructured":"Gribanov, D., Chirkov, A.: The width and integer optimization on simplices with bounded minors of the constraint matrices. Optim. Lett. 10, 1179\u20131189 (2016)","journal-title":"Optim. Lett."},{"key":"1651_CR18","unstructured":"Gribanov, D., Malyshev, D., Pardalos, P.: A note on the parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms (2020). arXiv:2002.01307"},{"key":"1651_CR19","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, 1351\u20131364 (1957)","journal-title":"Pac. J. Math."},{"key":"1651_CR20","doi-asserted-by":"crossref","unstructured":"Hildebrand, R., Weismantel, R., Zenklusen, R.: Extension complexity lower bounds for mixed-integer extended formulations. In: Proceedings of the 2017 ACM-SIAM Symposium on Discrete Algorithms, pp. 2342\u20132350 (2017)","DOI":"10.1137\/1.9781611974782.154"},{"key":"1651_CR21","unstructured":"Hupp, L.M.: Integer and Mixed-Integer Reformulations of Stochastic, Resource-Constrained, and Quadratic Matching Problems. Ph.D. Thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (2017)"},{"issue":"3","key":"1651_CR22","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"1651_CR23","volume-title":"Algebra","author":"S Lang","year":"2000","unstructured":"Lang, S.: Algebra. Springer, Berlin (2000)"},{"key":"1651_CR24","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"1651_CR25","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s00493-019-3900-1","volume":"39","author":"M Na\u030bgele","year":"2019","unstructured":"Na\u030bgele, M., Sudakov, B., Zenklusen, R.: Submodular minimization under congruency constraints. Combinatorica 39, 1351\u20131386 (2019)","journal-title":"Combinatorica"},{"key":"1651_CR26","series-title":"Graduate Texts in Mathematics","volume-title":"Elementary Methods in Number Theory","author":"MB Nathanson","year":"2000","unstructured":"Nathanson, M.B.: Elementary Methods in Number Theory. Graduate Texts in Mathematics, vol. 195. Springer, New York (2000)"},{"issue":"4","key":"1651_CR27","first-page":"839","volume":"3","author":"T Oertel","year":"2020","unstructured":"Oertel, T., Paat, J., Weismantel, R.: The distributions of functions related to parametric integer optimization. SIAM J. Appl. Algebra Geom. 3(4), 839\u2013850 (2020)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"1651_CR28","first-page":"341","volume":"2019","author":"T Oertel","year":"2019","unstructured":"Oertel, T., Paat, J., Weismantel, R.: Sparsity of integer solutions in the average case. Proc. IPCO 2019, 341\u2013353 (2019)","journal-title":"Proc. IPCO"},{"key":"1651_CR29","doi-asserted-by":"crossref","unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: The integrality number of an integer program. In: Proceedings of the 2020 International Integer Programming and Combinatorial Optimization Conference (2020)","DOI":"10.1007\/s10107-021-01651-0"},{"key":"1651_CR30","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":"1651_CR31","first-page":"349","volume":"28","author":"A Packer","year":"2004","unstructured":"Packer, A.: NP-Hardness of largest contained and smallest containing simplices for V- and H- polytopes. Discrete Appl. Math. 28, 349\u2013377 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1651_CR32","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"1651_CR33","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"S Veselov","year":"2009","unstructured":"Veselov, S., Chirkov, A.: Integer programming with bimodular matrix. Discrete Optim. 6, 220\u2013222 (2009)","journal-title":"Discrete Optim."},{"issue":"3","key":"1651_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(81)90016-0","volume":"3","author":"L Wolsey","year":"1981","unstructured":"Wolsey, L.: The b-hull of an integer program. Discrete Appl. Math. 3(3), 193\u2013201 (1981)","journal-title":"Discrete Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01651-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01651-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01651-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T22:51:24Z","timestamp":1698879084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01651-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,10]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1651"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01651-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,10]]},"assertion":[{"value":"29 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}