{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:39:00Z","timestamp":1787362740067,"version":"build-2736575974"},"reference-count":8,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1358695"],"award-info":[{"award-number":["1358695"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-13-1-0273"],"award-info":[{"award-number":["H98230-13-1-0273"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We consider a family of integer linear programs in which the coefficients of the constraints and objective function are polynomials of an integer parameter $t.$ For $\\ell$ in $\\mathbb{Z}_+,$ we define $f_\\ell(t)$ to be the $\\ell$th largest value of the objective function with multiplicity for the integer linear program at $t.$ We prove that for all $\\ell,$ $f_\\ell$ is eventually quasi-polynomial; that is, there exists $d$ and polynomials $P_0, \\ldots, P_{d-1}$ such that for sufficiently large $t,$ $f_\\ell(t)=P_{t({\\rm mod}\\ d)}(t).$ Closely related to finding the $\\ell$th largest value is describing the vertices of the convex hull of the feasible set. Calegari and Walker showed that if $R(t)$ is the convex hull of $\\mathbf{v_1}(t), \\ldots, \\mathbf{v_k}(t)$, where $\\mathbf{v_i}$ is a vector whose coordinates are in $\\mathbb{Q}(t)$ and of size $O(t),$ then the vertices of the convex hull of the set of lattice points in $R(t)$ has eventually quasi-polynomial structure. We prove this without the $O(t)$ assumption.<\/jats:p>","DOI":"10.1137\/16m1102458","type":"journal-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T11:53:37Z","timestamp":1516276417000},"page":"173-190","source":"Crossref","is-referenced-by-count":3,"title":["Parametrizing an Integer Linear Program by an Integer"],"prefix":"10.1137","volume":"32","author":[{"given":"Bobby","family":"Shen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,18]]},"reference":[{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2013-05775-3"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2011-05494-2"},{"key":"atypb4","first-page":"616","volume":"254","author":"Ehrhart E.","year":"1962","journal-title":"C. R. Acad. Sci. Paris"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-4.1.181"},{"key":"atypb6","unstructured":"C. Papadimitriou and K. Steiglitz,\n                      Combinatorial Optimization: Algorithms and Complexity,\n                      Dover, Mineola, NY, 1998."},{"key":"atypb7","unstructured":"B. Shen,\n                      The Parametric Frobenius Problem and Parametric Exclusion\n                      , preprint,arXiv:1510.01349[math.CO], 2015."},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1017\/jsl.2015.4"},{"key":"atypb9","doi-asserted-by":"crossref","first-page":"P1","DOI":"10.37236\/3750","volume":"21","author":"Woods K.","year":"2014","journal-title":"Electron. J. Combin."}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1102458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:45Z","timestamp":1787316825000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1102458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1102458"],"URL":"https:\/\/doi.org\/10.1137\/16m1102458","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}