{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:45:40Z","timestamp":1782161140673,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T00:00:00Z","timestamp":1554163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T00:00:00Z","timestamp":1554163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000866","name":"Cardiff University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000866","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10107-019-01392-1","type":"journal-article","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T16:04:12Z","timestamp":1554221052000},"page":"175-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Distances to lattice points in knapsack polyhedra"],"prefix":"10.1007","volume":"182","author":[{"given":"Iskander","family":"Aliev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1411-3033","authenticated-orcid":false,"given":"Martin","family":"Henk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timm","family":"Oertel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"key":"1392_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.orl.2015.01.008","volume":"43","author":"I Aliev","year":"2015","unstructured":"Aliev, I.: On the lattice programming gap of the group problems. Oper. Res. Lett. 43, 199\u2013202 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1392_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jnt.2006.05.020","volume":"123","author":"I Aliev","year":"2007","unstructured":"Aliev, I., Gruber, P.M.: An optimal lower bound for the Frobenius problem. J. Number Theory 123, 71\u201379 (2007)","journal-title":"J. Number Theory"},{"key":"1392_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcta.2009.12.012","volume":"118","author":"I Aliev","year":"2011","unstructured":"Aliev, I., Henk, M., Hinrichs, A.: Expected Frobenius numbers. J. Combin. Theory Ser. A 118, 525\u2013531 (2011)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1392_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-59250-3_3","volume":"10328","author":"I Aliev","year":"2017","unstructured":"Aliev, I., Henk, M., Oertel, T.: Integrality gaps of integer knapsack problems, integer programming and combinatorial optimization. Lect. Notes Comput. Sci. 10328, 25\u201338 (2017)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1392_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"1392_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A Brauer","year":"1942","unstructured":"Brauer, A.: On a problem of partitions. Am. J. Math. 64, 299\u2013312 (1942)","journal-title":"Am. J. Math."},{"key":"1392_CR7","volume-title":"An Introduction to the Geometry of Numbers","author":"JWS Cassels","year":"1971","unstructured":"Cassels, J.W.S.: An Introduction to the Geometry of Numbers. Springer, Berlin (1971)"},{"key":"1392_CR8","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. Progr. 34, 251\u2013264 (1986)","journal-title":"Math. Progr."},{"key":"1392_CR9","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/S0895480100372899","volume":"17","author":"R Dougherty","year":"2004","unstructured":"Dougherty, R., Faber, V.: The degree-diameter problem for several varieties of Cayley graphs. I. The abelian case. SIAM J. Discrete Math. 17, 478\u2013519 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"1392_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10107-012-0518-y","volume":"141","author":"F Eisenbrand","year":"2013","unstructured":"Eisenbrand, F., H\u00e4hnle, N., P\u00e1lv\u00f6lgyi, D., Shmonin, G.: Testing additive integrality gaps. Math. Progr. A 141, 257\u2013271 (2013)","journal-title":"Math. Progr. A"},{"key":"1392_CR11","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1287\/moor.1080.0320","volume":"33","author":"F Eisenbrand","year":"2008","unstructured":"Eisenbrand, F., Shmonin, G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33, 839\u2013850 (2008)","journal-title":"Math. Oper. Res."},{"key":"1392_CR12","first-page":"808","volume":"29","author":"F Eisenbrand","year":"2018","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the steinitz lemma. Proc. SODA 29, 808\u2013816 (2018)","journal-title":"Proc. SODA"},{"key":"1392_CR13","doi-asserted-by":"publisher","first-page":"152","DOI":"10.24033\/bsmf.1413","volume":"78","author":"I F\u00e1ry","year":"1950","unstructured":"F\u00e1ry, I.: Sur la densit\u00e9 des r\u00e9seaux de domaines convexes. Bull. Soc. Math. Fr. 78, 152\u2013161 (1950)","journal-title":"Bull. Soc. Math. Fr."},{"key":"1392_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2. Springer, Berlin (1988)"},{"key":"1392_CR15","volume-title":"Convex and Discrete Geometry","author":"PM Gruber","year":"2007","unstructured":"Gruber, P.M.: Convex and Discrete Geometry. Springer, Berlin (2007)"},{"key":"1392_CR16","volume-title":"Geometry of Numbers","author":"PM Gruber","year":"1987","unstructured":"Gruber, P.M., Lekkerkerker, C.G.: Geometry of Numbers. North-Holland, Amsterdam (1987)"},{"issue":"3","key":"1392_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s00493-007-2057-3","volume":"27","author":"S Ho\u015ften","year":"2007","unstructured":"Ho\u015ften, S., Sturmfels, B.: Computing the integer programming gap. Combinatorica 27(3), 367\u2013382 (2007)","journal-title":"Combinatorica"},{"key":"1392_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01204720","volume":"12","author":"R Kannan","year":"1992","unstructured":"Kannan, R.: Lattice translates of a polytope and the Frobenius problem. Combinatorica 12, 161\u2013177 (1992)","journal-title":"Combinatorica"},{"key":"1392_CR19","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00493-013-2820-6","volume":"33","author":"J Marklof","year":"2013","unstructured":"Marklof, J., Str\u00f6mbergsson, A.: Diameters of random circulant graphs. Combinatorica 33, 429\u2013466 (2013)","journal-title":"Combinatorica"},{"key":"1392_CR20","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001","volume-title":"The Diophantine Frobenius Problem, Oxford Lecture Series in Mathematics and Its Applications","author":"JL Ram\u00edrez Alfons\u00edn","year":"2005","unstructured":"Ram\u00edrez Alfons\u00edn, J.L.: The Diophantine Frobenius Problem, Oxford Lecture Series in Mathematics and Its Applications, vol. 30. Oxford University Press, Oxford (2005)"},{"key":"1392_CR21","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00605-015-0741-8","volume":"178","author":"WM Schmidt","year":"2015","unstructured":"Schmidt, W.M.: Integer matrices, sublattices of $${\\mathbb{Z}}^m$$, and Frobenius numbers. Monatsh. Math. 178, 405\u2013451 (2015)","journal-title":"Monatsh. Math."},{"key":"1392_CR22","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics. Wiley, Chichester (1986)"},{"key":"1392_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.4064\/aa152-1-7","volume":"152","author":"A Str\u00f6mbergsson","year":"2012","unstructured":"Str\u00f6mbergsson, A.: On the limit distribution of Frobenius numbers. Acta Arith. 152, 81\u2013107 (2012)","journal-title":"Acta Arith."},{"key":"1392_CR24","first-page":"123","volume":"12","author":"RR Thomas","year":"2005","unstructured":"Thomas, R.R.: The structure of group relaxations, handbooks in operations research and management. Science 12, 123\u2013170 (2005)","journal-title":"Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01392-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01392-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T15:15:11Z","timestamp":1592925311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01392-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,2]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1392"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01392-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,2]]},"assertion":[{"value":"4 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}