{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:43:54Z","timestamp":1764377034713,"version":"3.46.0"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10589-024-00632-1","type":"journal-article","created":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T01:41:11Z","timestamp":1733449271000},"page":"811-861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new and faster representation for counting integer points in parametric polyhedra"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4005-9483","authenticated-orcid":false,"given":"Dmitry V.","family":"Gribanov","sequence":"first","affiliation":[]},{"given":"Dmitry S.","family":"Malyshev","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Nikolai Yu.","family":"Zolotykh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,6]]},"reference":[{"issue":"6","key":"632_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1023\/A:1025117523902","volume":"25","author":"V Loechner","year":"1997","unstructured":"Loechner, V., Wilde, D.K.: Parameterized polyhedra and their vertices. Int. J. Parallel Program. 25(6), 525\u2013549 (1997)","journal-title":"Int. J. Parallel Program."},{"key":"632_CR2","doi-asserted-by":"crossref","unstructured":"Clauss, P.: Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs. In: Proceedings of the 10th International Conference on Supercomputing, pp. 278\u2013285 (1996)","DOI":"10.1145\/237578.237617"},{"key":"632_CR3","doi-asserted-by":"publisher","unstructured":"Clauss, P., Loechner, V.: Parametric analysis of polyhedral iteration spaces. In: Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP \u201996, pp. 415\u2013424 (1996). https:\/\/doi.org\/10.1109\/ASAP.1996.542833","DOI":"10.1109\/ASAP.1996.542833"},{"key":"632_CR4","doi-asserted-by":"crossref","unstructured":"Bao, W., Krishnamoorthy, S., Pouchet, L.-N., Sadayappan, P.: Analytical modeling of cache behavior for affine programs. In: Proceedings of the ACM on Programming Languages 2(POPL), pp. 1\u201326 (2017)","DOI":"10.1145\/3158120"},{"key":"632_CR5","doi-asserted-by":"crossref","unstructured":"Gysi, T., Grosser, T., Brandner, L., Hoefler, T.: A fast analytical model of fully associative caches. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 816\u2013829 (2019)","DOI":"10.1145\/3314221.3314606"},{"issue":"1","key":"632_CR6","first-page":"1","volume":"20","author":"NR Shah","year":"2022","unstructured":"Shah, N.R., Misra, A., Min\u00e9, A., Venkat, R., Upadrasta, R.: Bullseye: scalable and accurate approximation framework for cache miss calculation. ACM Transact. Archit. Code Optim. 20(1), 1\u201328 (2022)","journal-title":"ACM Transact. Archit. Code Optim."},{"key":"632_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-022-01165-9","author":"VD Gribanov","year":"2022","unstructured":"Gribanov, V.D., Shumilov, A.I., Malyshev, S.D., Pardalos, M.P.: On $$\\delta $$-modular integer linear problems in the canonical form and equivalent problems. J. Glob. Optim. (2022). https:\/\/doi.org\/10.1007\/s10898-022-01165-9","journal-title":"J. Glob. Optim."},{"key":"632_CR8","volume-title":"Parameterized Complexity","author":"GR Downey","year":"2012","unstructured":"Downey, G.R., Fellows, R.M.: Parameterized Complexity. Springer, New York (2012)"},{"key":"632_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, V.F., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"key":"632_CR10","doi-asserted-by":"publisher","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. In: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp. 566\u2013572 (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366830","DOI":"10.1109\/SFCS.1993.366830"},{"issue":"3","key":"632_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1287\/moor.22.3.545","volume":"22","author":"M Dyer","year":"1997","unstructured":"Dyer, M., Kannan, R.: On Barvinok\u2019s algorithm for counting lattice points in fixed dimension. Math. Op. Res. 22(3), 545\u2013549 (1997). https:\/\/doi.org\/10.1287\/moor.22.3.545","journal-title":"Math. Op. Res."},{"key":"632_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1017\/9781009701587.004","volume":"38","author":"A Barvinok","year":"1999","unstructured":"Barvinok, A., Pommersheim, J.: An algorithmic theory of lattice points in polyhedra. New Perspect. Algebraic Combin. 38, 91\u2013147 (1999)","journal-title":"New Perspect. Algebraic Combin."},{"key":"632_CR13","doi-asserted-by":"publisher","DOI":"10.4171\/052","volume-title":"Integer Points in Polyhedra","author":"A Barvinok","year":"2008","unstructured":"Barvinok, A.: Integer Points in Polyhedra. European Mathematical Society, ETH-Zentrum, Z\u00fcrich, Switzerland (2008)"},{"issue":"4","key":"632_CR14","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0894-0347-03-00428-4","volume":"16","author":"A Barvinok","year":"2003","unstructured":"Barvinok, A., Woods, K.: Short rational generating functions for lattice point problems. J. Am. Math. Soc. 16(4), 957\u2013979 (2003)","journal-title":"J. Am. Math. Soc."},{"key":"632_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2969-6","volume-title":"Comput. Contin. Discret.","author":"M Beck","year":"2015","unstructured":"Beck, M., Robins, S.: Comput. Contin. Discret. Springer, New York (2015)"},{"key":"632_CR16","doi-asserted-by":"crossref","unstructured":"De Loera, J., Hemmecke, R., K\u00f6ppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2013)","DOI":"10.1137\/1.9781611972443"},{"key":"632_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09414-4","volume-title":"Linear and Integer Programming Vs Linear Integration and Counting: a Duality Viewpoint","author":"J-B Lasserre","year":"2009","unstructured":"Lasserre, J.-B.: Linear and Integer Programming Vs Linear Integration and Counting: a Duality Viewpoint. Springer, New York (2009)"},{"key":"632_CR18","doi-asserted-by":"publisher","DOI":"10.37236\/740","author":"M K\u00f6ppe","year":"2008","unstructured":"K\u00f6ppe, M., Verdoolaege, S.: Computing parametric rational generating functions with a primal Barvinok algorithm. Electron. J. Comb. (2008). https:\/\/doi.org\/10.37236\/740","journal-title":"Electron. J. Comb."},{"issue":"3","key":"632_CR19","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. SIAM J. Comput. 42(3), 1364\u20131391 (2013)","journal-title":"SIAM J. Comput."},{"key":"632_CR20","doi-asserted-by":"publisher","DOI":"10.33048\/semi.2022.19.051","author":"VD Gribanov","year":"2022","unstructured":"Gribanov, V.D., Malyshev, S.D.: A faster algorithm for counting the integer points number in $$\\delta $$modular polyhedra. Sib. Electron. Math. Rep. (2022). https:\/\/doi.org\/10.33048\/semi.2022.19.051","journal-title":"Sib. Electron. Math. Rep."},{"key":"632_CR21","doi-asserted-by":"crossref","unstructured":"Lasserre, B. Jean, Zeron, S. Eduardo: Simple explicit formula for counting lattice points of polyhedra. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 367\u2013381 (2007). Springer","DOI":"10.1007\/978-3-540-72792-7_28"},{"key":"632_CR22","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s10898-024-01379-z","volume":"89","author":"D Gribanov","year":"2024","unstructured":"Gribanov, D., Shumilov, I., Malyshev, D., Zolotykh, N.: Faster algorithms for sparse ilp and hypergraph multi-packing\/multi-cover problems. J. Glob. Optim. 89, 1033\u20131067 (2024). https:\/\/doi.org\/10.1007\/s10898-024-01379-z","journal-title":"J. Glob. Optim."},{"issue":"7","key":"632_CR23","doi-asserted-by":"publisher","first-page":"1991","DOI":"10.1007\/s11590-021-01744-x","volume":"16","author":"DV Gribanov","year":"2022","unstructured":"Gribanov, D.V., Zolotykh, N.Y.: On lattice point counting in $$\\delta $$-modular polyhedra. Optim. Lett. 16(7), 1991\u20132018 (2022). https:\/\/doi.org\/10.1007\/s11590-021-01744-x","journal-title":"Optim. Lett."},{"key":"632_CR24","unstructured":"Gribanov, D., Shumilov, I., Malyshev, D.: A faster algorithm for counting the integer points number in $$\\Delta $$-modular polyhedra (corrected version) (2023)"},{"issue":"6","key":"632_CR25","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0167-6377(02)00161-X","volume":"30","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B., Zeron, E.S.: Solving the knapsack problem via z-transform. Op. Res. Lett. 30(6), 394\u2013400 (2002)","journal-title":"Op. Res. Lett."},{"issue":"4","key":"632_CR26","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1287\/moor.28.4.853.20518","volume":"28","author":"JB Lasserre","year":"2003","unstructured":"Lasserre, J.B., Zeron, E.S.: On counting integral points in a convex rational polytope. Math. Op. Res. 28(4), 853\u2013870 (2003)","journal-title":"Math. Op. Res."},{"key":"632_CR27","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1287\/ijoc.2021.1142","volume":"34","author":"E Daues","year":"2022","unstructured":"Daues, E., Friedrich, U.: Computing optimized path integrals for knapsack feasibility. INFORMS J. Comput. 34, 2163\u20132176 (2022)","journal-title":"INFORMS J. Comput."},{"key":"632_CR28","unstructured":"Friedrich, U.: Solving ip via complex integration on shortest paths. Preprint available at http:\/\/www.optimization-online.org\/DB_HTML\/2020\/06\/7848.html (2020)"},{"issue":"2","key":"632_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/moor.2019.0997","volume":"45","author":"H Hirai","year":"2020","unstructured":"Hirai, H., Oshiro, R., Tanaka, K.: Counting integral points in polytopes via numerical analysis of contour integration. Math. Op. Res. 45(2), 455\u2013464 (2020). https:\/\/doi.org\/10.1287\/moor.2019.0997","journal-title":"Math. Op. Res."},{"key":"632_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1515\/crll.1967.227.25","volume":"227","author":"E Ehrhart","year":"1967","unstructured":"Ehrhart, E.: Sur un probl\u00e8me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. ii. Syst\u00e8mes diophantiens lin\u00e9aires. J. Reine Angew. Math. 227, 25\u201349 (1967). https:\/\/doi.org\/10.1515\/crll.1967.227.25","journal-title":"J. Reine Angew. Math."},{"key":"632_CR31","first-page":"1","volume":"35","author":"E Ehrhart","year":"1977","unstructured":"Ehrhart, E.: Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e8dres en combinatoire. Int. Ser. Numer. Math. 35, 1\u2013165 (1977)","journal-title":"Int. Ser. Numer. Math."},{"issue":"255","key":"632_CR32","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1090\/S0025-5718-06-01836-9","volume":"75","author":"A Barvinok","year":"2006","unstructured":"Barvinok, A.: Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75(255), 1449\u20131466 (2006). https:\/\/doi.org\/10.1090\/S0025-5718-06-01836-9","journal-title":"Math. Comput."},{"key":"632_CR33","unstructured":"Henk, M., Linke, E.: Lattice points in vector-dilated polytopes (2012)"},{"issue":"7","key":"632_CR34","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1016\/j.jcta.2011.03.007","volume":"118","author":"E Linke","year":"2011","unstructured":"Linke, E.: Rational Ehrhart quasi-polynomials. J. Comb. Theory, Ser. A 118(7), 1966\u20131978 (2011)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"632_CR35","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-006-1231-0","volume":"48","author":"S Verdoolaege","year":"2007","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using barvinok\u2019s rational functions. Algorithmica 48(1), 37\u201366 (2007). https:\/\/doi.org\/10.1007\/s00453-006-1231-0","journal-title":"Algorithmica"},{"issue":"2","key":"632_CR36","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jsc.2007.07.007","volume":"43","author":"S Verdoolaege","year":"2008","unstructured":"Verdoolaege, S., Woods, K.: Counting with rational generating functions. J. Symb. Comput. 43(2), 75\u201391 (2008). https:\/\/doi.org\/10.1016\/j.jsc.2007.07.007","journal-title":"J. Symb. Comput."},{"key":"632_CR37","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jcta.2017.04.004","volume":"151","author":"A Stapledon","year":"2017","unstructured":"Stapledon, A.: Counting lattice points in free sums of polytopes. J. Comb. Theory, Ser. A 151, 51\u201360 (2017)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"632_CR38","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1112\/S0025579315000418","volume":"62","author":"V Baldoni","year":"2016","unstructured":"Baldoni, V., Berline, N., De Loera, J.A., Koeppe, M., Vergne, M.: Intermediate sums on polyhedra ii: bidegree and poisson formula. Mathematika 62(3), 653\u2013684 (2016)","journal-title":"Mathematika"},{"issue":"3","key":"632_CR39","first-page":"379","volume":"2","author":"V Baldoni","year":"2019","unstructured":"Baldoni, V., Berline, N., De Loera, J.A., K\u00f6ppe, M., Vergne, M.: Three Ehrhart quasi-polynomials. Algebr. Comb. 2(3), 379\u2013416 (2019)","journal-title":"Algebr. Comb."},{"issue":"1","key":"632_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0025579312000101","volume":"59","author":"V Baldoni","year":"2013","unstructured":"Baldoni, V., Berline, N., K\u00f6ppe, M., Vergne, M.: Intermediate sums on polyhedra: computation and real Ehrhart theory. Mathematika 59(1), 1\u201322 (2013). https:\/\/doi.org\/10.1112\/S0025579312000101","journal-title":"Mathematika"},{"key":"632_CR41","unstructured":"Beck, M., Elia, S., Rehberg, S.: Rational ehrhart theory. arXiv preprint arXiv:2110.10204 (2021)"},{"key":"632_CR42","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10208-011-9106-4","volume":"12","author":"V Baldoni","year":"2012","unstructured":"Baldoni, V., Berline, N., De Loera, J.A., K\u00f6ppe, M., Vergne, M.: Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra. Found. Comput. Math. 12, 435\u2013469 (2012)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"632_CR43","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1090\/S0894-0347-97-00229-4","volume":"10","author":"M Brion","year":"1997","unstructured":"Brion, M., Vergne, M.: Lattice points in simple polytopes. J. Am. Math. Soc. 10(2), 371\u2013392 (1997)","journal-title":"J. Am. Math. Soc."},{"issue":"4","key":"632_CR44","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1090\/S0894-0347-97-00242-7","volume":"10","author":"M Brion","year":"1997","unstructured":"Brion, M., Vergne, M.: Residue formulae, vector partition functions and lattice points in rational polytopes. J. Am. Math. Soc. 10(4), 797\u2013833 (1997)","journal-title":"J. Am. Math. Soc."},{"issue":"3","key":"632_CR45","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009853104418","volume":"4","author":"M Beck","year":"2000","unstructured":"Beck, M.: Counting lattice points by means of the residue theorem. Ramanujan J 4(3), 299\u2013310 (2000)","journal-title":"Ramanujan J"},{"issue":"4","key":"632_CR46","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00454-004-1131-5","volume":"32","author":"M Beck","year":"2004","unstructured":"Beck, M.: The partial-fractions method for counting solutions to integral linear systems. Discret. Comput. Geom. 32(4), 437\u2013446 (2004)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"632_CR47","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00454-001-0082-3","volume":"27","author":"M Beck","year":"2002","unstructured":"Beck, M., Robins, S.: Explicit and efficient formulas for the lattice point count in rational polygons using dedekind-rademacher sums. Discret. Comput. Geom. 27(4), 443\u2013460 (2002)","journal-title":"Discret. Comput. Geom."},{"key":"632_CR48","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Fast fourier transform and its applications to integer knapsack problems (2004)","DOI":"10.2139\/ssrn.675602"},{"issue":"3","key":"632_CR49","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1287\/moor.1050.0145","volume":"30","author":"JB Lasserre","year":"2005","unstructured":"Lasserre, J.B., Zeron, E.S.: An alternative algorithm for counting lattice points in a convex polytope. Math. Op. Res. 30(3), 597 (2005). https:\/\/doi.org\/10.1287\/moor.1050.0145","journal-title":"Math. Op. Res."},{"issue":"4","key":"632_CR50","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981). https:\/\/doi.org\/10.1145\/322276.322287","journal-title":"J. ACM"},{"key":"632_CR51","unstructured":"Jansen, K., Rohwedder, L.: On integer programming and convolution. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"1","key":"632_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340322","volume":"16","author":"F Eisenbrand","year":"2019","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Transact. Algorithms 16(1), 1 (2019). https:\/\/doi.org\/10.1145\/3340322","journal-title":"ACM Transact. Algorithms"},{"issue":"3","key":"632_CR53","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discret. Comput. Geom. 8(3), 295\u2013313 (1992). https:\/\/doi.org\/10.1007\/BF02293050","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"632_CR54","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0925-7721(02)00103-7","volume":"23","author":"V Kaibel","year":"2002","unstructured":"Kaibel, V., Pfetsch, M.E.: Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom. 23(3), 281\u2013290 (2002)","journal-title":"Comput. Geom."},{"key":"632_CR55","doi-asserted-by":"crossref","unstructured":"Barvinok, A.(2002): A course in convexity. American Mathematical Society","DOI":"10.1090\/gsm\/054"},{"key":"632_CR56","doi-asserted-by":"crossref","unstructured":"McMullen, P.: Chapter 3.6\u2014valuations and dissections. In: Gruber, P.M., Wills, J.M. (eds.) Handbook of Convex Geometry, pp. 933\u2013988. North-Holland, Amsterdam (1993)","DOI":"10.1016\/B978-0-444-89597-4.50010-X"},{"key":"632_CR57","doi-asserted-by":"publisher","unstructured":"McMullen, P., Schneider, R.: Valuations on convex bodies. In: Gruber, P.M., Wills, J.M. (eds) Convexity and Its Applications. Birkh\u00e4user, Basel (1983). https:\/\/doi.org\/10.1007\/978-3-0348-5858-8_9","DOI":"10.1007\/978-3-0348-5858-8_9"},{"issue":"1","key":"632_CR58","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/BF01226481","volume":"31","author":"P McMullen","year":"1978","unstructured":"McMullen, P.: Lattice invariant valuations on rational polytopes. Archiv der Mathematik 31(1), 509\u2013516 (1978). https:\/\/doi.org\/10.1007\/BF01226481","journal-title":"Archiv der Mathematik"},{"key":"632_CR59","first-page":"199","volume":"6","author":"J Lawrence","year":"1991","unstructured":"Lawrence, J.: Rational-function-valued valuations on polyhedra. Discret. Comput. Geom. 6, 199\u2013208 (1991)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"632_CR60","first-page":"188","volume":"4","author":"AV Pukhlikov","year":"1992","unstructured":"Pukhlikov, A.V., Khovanskii, A.G.: The riemann-roch theorem for integrals and sums of quasipolynomials on virtual polytopes (russian). Algebra i analiz 4(4), 188\u2013216 (1992)","journal-title":"Algebra i analiz"},{"issue":"4","key":"632_CR61","doi-asserted-by":"publisher","first-page":"653","DOI":"10.24033\/asens.1572","volume":"21","author":"M Brion","year":"1988","unstructured":"Brion, M.: Points entiers dans les poly\u00e8dres convexes. Annales scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure 4e s\u2019erie 21(4), 653\u2013663 (1988). https:\/\/doi.org\/10.24033\/asens.1572","journal-title":"Annales scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure 4e s\u2019erie"},{"issue":"2","key":"632_CR62","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17(2), 179\u2013184 (1970). https:\/\/doi.org\/10.1112\/S0025579300002850","journal-title":"Mathematika"},{"issue":"2","key":"632_CR63","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/sapm1975542135","volume":"54","author":"R Stanley","year":"1975","unstructured":"Stanley, R.: The upper bound conjecture and cohen-macaulay rings. Stud. Appl. Math. 54(2), 135\u2013142 (1975). https:\/\/doi.org\/10.1002\/sapm1975542135","journal-title":"Stud. Appl. Math."},{"key":"632_CR64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations: Structures for Algorithms and Applications","author":"J De Loera","year":"2010","unstructured":"De Loera, J., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications. Springer, Berlin Heidelberg (2010)"},{"key":"632_CR65","volume-title":"Combinatorics and Commutative Algebra","author":"R Stanley","year":"2007","unstructured":"Stanley, R.: Combinatorics and Commutative Algebra, vol. 41. Birkh\u00e4user, Boston (2007)"},{"key":"632_CR66","volume-title":"Convex Polytopes","author":"B Gr\u00fcnbaum","year":"2011","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Graduate Texts in Mathematics. Springer, New York (2011)"},{"issue":"1","key":"632_CR67","first-page":"17","volume":"8","author":"SI Veselov","year":"2001","unstructured":"Veselov, S.I.: A proof of a generalization of the Borosh-Treybig conjecture on diophantine equations. Diskretnyi Analiz i Issledovanie Operatsii 8(1), 17\u201322 (2001). (in Russian)","journal-title":"Diskretnyi Analiz i Issledovanie Operatsii"},{"issue":"4","key":"632_CR68","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/0114068","volume":"14","author":"OR Winder","year":"1966","unstructured":"Winder, O.R.: Partitions of n-space by hyperplanes. SIAM J. Appl. Math. 14(4), 811\u2013818 (1966). https:\/\/doi.org\/10.1137\/0114068","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"632_CR69","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1134\/S1990478908010122","volume":"2","author":"NV Shevchenko","year":"2008","unstructured":"Shevchenko, N.V., Gruzdev, V.D.: A modification of the Fourier-Motzkin algorithm for constructing a triangulation and star development. J. Appl. Ind. Math. 2(1), 113\u2013124 (2008). https:\/\/doi.org\/10.1134\/S1990478908010122","journal-title":"J. Appl. Ind. Math."},{"key":"632_CR70","doi-asserted-by":"publisher","unstructured":"Storjohann, A.: Near optimal algorithms for computing Smith normal forms of integer matrices. In: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201996, pp. 267\u2013274. Association for Computing Machinery, New York, (1996). https:\/\/doi.org\/10.1145\/236869.237084","DOI":"10.1145\/236869.237084"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00632-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00632-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00632-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T10:28:08Z","timestamp":1764325688000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00632-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,6]]},"references-count":70,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["632"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00632-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,12,6]]},"assertion":[{"value":"29 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 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":"The authors have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}