{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:07:56Z","timestamp":1768342076569,"version":"3.49.0"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007675","name":"Laboratory of Algorithms and Technologies for Networks Analysis","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007675","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11590-021-01744-x","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T07:02:21Z","timestamp":1621926141000},"page":"1991-2018","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On lattice point counting in $$\\varDelta $$-modular polyhedra"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4005-9483","authenticated-orcid":false,"given":"D. V.","family":"Gribanov","sequence":"first","affiliation":[]},{"given":"N. Yu.","family":"Zolotykh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,25]]},"reference":[{"key":"1744_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1134\/S1990478911010029","volume":"5","author":"VV Alekseev","year":"2011","unstructured":"Alekseev, V.V., Zakharova, D.V.: Independent sets in the graphs with bounded minors of the extended incidence matrix. J. Appl. Ind. Math. 5, 14\u201318 (2011). https:\/\/doi.org\/10.1134\/S1990478911010029","journal-title":"J. Appl. Ind. Math."},{"key":"1744_CR2","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1137\/17M1162792","volume":"28","author":"I Aliev","year":"2018","unstructured":"Aliev, I., De Loera, J., Eisenbrand, F., Oertel, T., Weismantel, R.: The support of integer optimal solutions. SIAM J. Optim. 28, 2152\u2013215 (2018). https:\/\/doi.org\/10.1137\/17M1162792","journal-title":"SIAM J. Optim."},{"key":"1744_CR3","doi-asserted-by":"publisher","unstructured":"Artmann,\u00a0S., Weismantel,\u00a0R., Zenklusen,\u00a0R.: A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of 49th Annual ACM Symposium on Theory of Computing, pp. 1206\u20131219 (2017). https:\/\/doi.org\/10.1145\/3055399.3055473","DOI":"10.1145\/3055399.3055473"},{"issue":"5","key":"1744_CR4","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., Timm, O., Vempala, S., Weismantel, R.: A note on non-degenerate integer programs with small subdeterminants. Oper. Res. Lett. 44(5), 635\u2013639 (2016). https:\/\/doi.org\/10.1016\/j.orl.2016.07.004","journal-title":"Oper. Res. Lett."},{"key":"1744_CR5","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, V.: Intermediate sums on polyhedra: computational and real Ehrhart theory. Mathematika 59, 1\u201322 (2013). https:\/\/doi.org\/10.1112\/S0025579312000101","journal-title":"Mathematika"},{"key":"1744_CR6","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 the 34th Annual Symposium on Foundations of Computer Science, IEEE, New York, Nov., pp. 566\u2013572. (1993) https:\/\/doi.org\/10.1287\/moor.19.4.769","DOI":"10.1287\/moor.19.4.769"},{"key":"1744_CR7","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1090\/S0025-5718-06-01836-9","volume":"75","author":"AI Barvinok","year":"2006","unstructured":"Barvinok, A.I.: Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75, 1449\u20131466 (2006). https:\/\/doi.org\/10.1090\/S0025-5718-06-01836-9","journal-title":"Math. Comput."},{"key":"1744_CR8","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, Z\u00fcrich (2008)"},{"key":"1744_CR9","first-page":"91","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":"1744_CR10","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, 957\u2013979 (2003). https:\/\/doi.org\/10.1090\/S0894-0347-03-00428-4","journal-title":"J. Am. Math. Soc."},{"key":"1744_CR11","doi-asserted-by":"publisher","unstructured":"Bock, A., Faenza, Y., Moldenhauer, C., Vargas, R., Jacinto, A.: Solving the stable set problem in terms of the odd cycle packing number. In: Proceedings of 34th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), vol. 29, pp. 187\u2013198 (2014). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2014.187","DOI":"10.4230\/LIPIcs.FSTTCS.2014.187"},{"issue":"1","key":"1744_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00454-014-9601-x","volume":"52","author":"N Bonifas","year":"2014","unstructured":"Bonifas, N., Di Summa, M., Eisenbrand, F., H\u00e4hnle, N., Niemeier, M.: On subdeterminants and the diameter of polyhedra. Discrete Comput. Geom. 52(1), 102\u2013115 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9601-x","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"1744_CR13","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 (French). Ann. Sci. Ecole Norm. Sup. 21(4), 653\u2013663 (1988). https:\/\/doi.org\/10.24033\/asens.1572","journal-title":"Ann. Sci. Ecole Norm. Sup."},{"issue":"4","key":"1744_CR14","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s10898-018-0729-8","volume":"73","author":"AY Chirkov","year":"2019","unstructured":"Chirkov, A.Y., Gribanov, D.V., Malyshev, D.S., Pardalos, P.M., Veselov, S.I., Zolotykh, N.Y.: On the complexity of quasiconvex integer minimization problem. J. Glob. Optim. 73(4), 761\u2013788 (2019). https:\/\/doi.org\/10.1007\/s10898-018-0729-8","journal-title":"J. Glob. Optim."},{"key":"1744_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008069920230","volume":"19","author":"P Clauss","year":"1998","unstructured":"Clauss, P., Loechner, V.: Parametric Analysis of Polyhedral Iteration Spaces. J. VLSI Signal Process. Syst. Signal, Image Video Technol. 19, 179\u2013194 (1998). https:\/\/doi.org\/10.1023\/A:1008069920230","journal-title":"J. VLSI Signal Process. Syst. Signal, Image Video Technol."},{"issue":"3","key":"1744_CR16","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, E.: Sensitivity theorems in integer linear programming. Math. Program. 34(3), 251\u2013264 (1986). https:\/\/doi.org\/10.1007\/BF01582230","journal-title":"Math. Program."},{"key":"1744_CR17","doi-asserted-by":"publisher","unstructured":"Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via M-ellipsoid coverings. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 11) 580\u2013589 (2011) https:\/\/doi.org\/10.1109\/FOCS.2011.31","DOI":"10.1109\/FOCS.2011.31"},{"key":"1744_CR18","unstructured":"Dadush, D.: Integer programming, lattice algorithms, and deterministic volume estimation. ProQuest LLC, Ann Arbor, MI. Thesis (Ph.D.), Georgia Institute of Technology (2012)"},{"issue":"4","key":"1744_CR19","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"JA De Loera","year":"2004","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symbol. Comput. 38(4), 1273\u20131302 (2004). https:\/\/doi.org\/10.1016\/j.jsc.2003.04.003","journal-title":"J. Symbol. Comput."},{"key":"1744_CR20","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, vol. 25. Springer, New York (2010)"},{"key":"1744_CR21","doi-asserted-by":"crossref","unstructured":"De\u00a0Loera,\u00a0Jes\u00fas\u00a0A., Hemmecke\u00a0R., K\u00f6ppe\u00a0M.: Algebraic And geometric ideas in the theory of discrete optimization. MOS-SIAM Series on Optimization (2012)","DOI":"10.1137\/1.9781611972443"},{"issue":"3","key":"1744_CR22","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. Oper. Res. 22(3), 545\u2013549 (1997). https:\/\/doi.org\/10.1287\/moor.22.3.545","journal-title":"Math. Oper. Res."},{"key":"1744_CR23","unstructured":"Ehrhart,\u00a0E.: Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e8dres en combinatoire. In: Volume 35 of International Series of Numerical Mathematics, Birkhauser Verlag, Basel\/Stuttgart (1977)"},{"key":"1744_CR24","first-page":"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)","journal-title":"J. Reine Angew. Math."},{"key":"1744_CR25","doi-asserted-by":"publisher","unstructured":"Eisenbrand, F., Shmonin, G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33 (2008). https:\/\/doi.org\/10.1287\/moor.1080.0320","DOI":"10.1287\/moor.1080.0320"},{"key":"1744_CR26","doi-asserted-by":"publisher","unstructured":"Eisenbrand,\u00a0F., Weismantel,\u00a0R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Trans. Algorithms 16(1) (2019) https:\/\/doi.org\/10.1145\/3340322","DOI":"10.1145\/3340322"},{"key":"1744_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-016-1089-0","volume":"164","author":"F Eisenbrand","year":"2017","unstructured":"Eisenbrand, F., Vempala, S.: Geometric random edge. Math. Program. 164, 325\u2013339 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1089-0","journal-title":"Math. Program."},{"key":"1744_CR28","doi-asserted-by":"publisher","unstructured":"Glanzer, C., Weismantel, R., Zenklusen, R.: On the number of distinct rows of a matrix with bounded subdeterminants. SIAM J. Discrete Math. (2018). https:\/\/doi.org\/10.1137\/17M1125728","DOI":"10.1137\/17M1125728"},{"issue":"2","key":"1744_CR29","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 non-integer solutions to linear programs. Proc. Natl. Acad. Sci. USA 53(2), 260\u2013265 (1965). https:\/\/doi.org\/10.1073\/pnas.53.2.260","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1744_CR30","doi-asserted-by":"publisher","unstructured":"Gribanov, D.V.: The flatness theorem for some class of polytopes and searching an integer point. In: Batsyn, M.V., Kalyagin, V.A., Pardalos, P.M. (eds) Models, Algorithms and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics, vol. 104, pp. 37\u201345 (2013). https:\/\/doi.org\/10.1007\/978-3-319-09758-9_4","DOI":"10.1007\/978-3-319-09758-9_4"},{"issue":"6","key":"1744_CR31","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s11590-016-1048-y","volume":"10","author":"DV Gribanov","year":"2016","unstructured":"Gribanov, D.V., Chirkov, A.J.: The width and integer optimization on simplices with bounded minors of the constraint matrices. Optim. Lett. 10(6), 1179\u20131189 (2016). https:\/\/doi.org\/10.1007\/s11590-016-1048-y","journal-title":"Optim. Lett."},{"key":"1744_CR32","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.dam.2017.04.025","volume":"227","author":"DV Gribanov","year":"2017","unstructured":"Gribanov, D.V., Malyshev, D.S.: The computational complexity of three graph problems for instances with bounded minors of constraint matrices. Discret. Appl. Math. 227, 13\u201320 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.04.025","journal-title":"Discret. Appl. Math."},{"key":"1744_CR33","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.disopt.2018.03.002","volume":"29","author":"DV Gribanov","year":"2018","unstructured":"Gribanov, D.V., Malyshev, D.S.: The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discret. Optim. 29, 103\u2013110 (2018). https:\/\/doi.org\/10.1016\/j.disopt.2018.03.002","journal-title":"Discret. Optim."},{"key":"1744_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22629-9_16","volume-title":"Mathematical Optimization Theory and Operations Research. MOTOR 2019 Lecture Notes in Computer Science","author":"DV Gribanov","year":"2019","unstructured":"Gribanov, D.V., Malyshev, D.S.: Integer conic function minimization based on the comparison oracle. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) Mathematical Optimization Theory and Operations Research. MOTOR 2019 Lecture Notes in Computer Science, vol. 11548. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22629-9_16"},{"key":"1744_CR35","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1134\/S199047892001007X","volume":"14","author":"DV Gribanov","year":"2020","unstructured":"Gribanov, D.V., Malyshev, D.S.: Minimization of even conic functions on the two-dimensional integral lattice. J. Appl. Ind. Math. 14, 56\u201372 (2020). https:\/\/doi.org\/10.1134\/S199047892001007X","journal-title":"J. Appl. Ind. Math."},{"issue":"6","key":"1744_CR36","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11590-015-0943-y","volume":"10","author":"DV Gribanov","year":"2016","unstructured":"Gribanov, D.V., Veselov, S.I.: On integer programming with bounded determinants. Optim. Lett. 10(6), 1169\u20131177 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0943-y","journal-title":"Optim. Lett."},{"issue":"4","key":"1744_CR37","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1007\/s10878-018-0264-z","volume":"35","author":"DV Gribanov","year":"2018","unstructured":"Gribanov, D.V., Malyshev, D.S., Pardalos, P.M., Veselov, S.I.: FPT-algorithms for some problems related to integer programming. J. Comb. Optim. 35(4), 1128\u20131146 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0264-z","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1744_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3103\/S0278641919010084","volume":"43","author":"DV Gribanov","year":"2019","unstructured":"Gribanov, D.V., Malyshev, D.S., Veselov, S.I.: FPT-algorithm for computing the width of a simplex given by a convex hull. Mosc. Univ. Comput. Math. Cybern. 43(1), 1\u201311 (2019). https:\/\/doi.org\/10.3103\/S0278641919010084","journal-title":"Mosc. Univ. Comput. Math. Cybern."},{"key":"1744_CR39","first-page":"12","volume":"10","author":"M Henk","year":"2015","unstructured":"Henk, M., Linke, E.: Note on the coefficients of rational Ehrhart quasi-polynomials of Minkowski-sums. Online J. Anal. Combin. 10, 12 (2015)","journal-title":"Online J. Anal. Combin."},{"issue":"2","key":"1744_CR40","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/moor.2019.0997","volume":"45","author":"H Hiroshi","year":"2020","unstructured":"Hiroshi, H., Ryunosuke, O., Ke\u0144ichiro, T.: Counting integral points in polytopes via numerical analysis of contour integration. Math. Oper. Res. 45(2), 455\u2013464 (2020). https:\/\/doi.org\/10.1287\/moor.2019.0997","journal-title":"Math. Oper. Res."},{"key":"1744_CR41","volume-title":"Handbook of Global Optimization","year":"1995","unstructured":"Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Springer, New York (1995)"},{"key":"1744_CR42","volume-title":"Integer Programming and Network Flows","author":"TC Hu","year":"1970","unstructured":"Hu, T.C.: Integer Programming and Network Flows. Addison-Wesley Publishing Company, Reading (1970)"},{"key":"1744_CR43","unstructured":"Jansen,\u00a0K., Rohwedder,\u00a0L.: On integer programming, discrepancy, and convolution (2018). arXiv:1803.04744"},{"issue":"4","key":"1744_CR44","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4(4), 373\u2013391 (1984). https:\/\/doi.org\/10.1007\/BF02579150","journal-title":"Combinatorica"},{"issue":"1","key":"1744_CR45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01188714","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan, L.G.: Polynomial algorithms in linear programming. Comput. Math. Math. Phys. 20(1), 53\u201372 (1980). https:\/\/doi.org\/10.1007\/BF01188714","journal-title":"Comput. Math. Math. Phys."},{"key":"#cr-split#-1744_CR46.1","unstructured":"Khovanskii,\u00a0A.G., Pukhlikov,\u00a0A.V.: The Riemann-Roch theorem for integrals and sums of quasipolynomials on virtual polytopes (Russian). Algebra i Analiz 4, 188-216 (1992)"},{"key":"#cr-split#-1744_CR46.2","unstructured":"translation in St. Petersburg Math. J. 4 789-812 (1993)"},{"key":"1744_CR47","doi-asserted-by":"publisher","unstructured":"K\u00f6ppe, M., Verdoolaege, S.: Computing parametric rational generating functions with a primal Barvinok algorithm. Electron. J. Combin. (2008). https:\/\/doi.org\/10.37236\/740","DOI":"10.37236\/740"},{"issue":"3","key":"1744_CR48","doi-asserted-by":"publisher","first-page":"595","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. Oper. Res. 30(3), 595\u2013614 (2005). https:\/\/doi.org\/10.1287\/moor.1050.0145","journal-title":"Math. Oper. Res."},{"key":"1744_CR49","doi-asserted-by":"crossref","unstructured":"Lawrence,\u00a0J.: Rational-function-valued valuations on polyhedra. Discrete and computational geometry (New Brunswick, NJ, 1989\/1990), DIMACS, Discrete Mathematics and Theoretical Computer Science, vol. 6, American Mathematical Society, Providence, RI, pp. 199\u2013208 (1991)","DOI":"10.1090\/dimacs\/006\/12"},{"key":"1744_CR50","doi-asserted-by":"crossref","unstructured":"Lee,\u00a0J., Paat,\u00a0J., Stallknecht,\u00a0I., Xu,\u00a0L.: Improving proximity bounds using sparsity (2020) arXiv:2001.04659","DOI":"10.1007\/978-3-030-53262-8_10"},{"issue":"4","key":"1744_CR51","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"1744_CR52","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 Prog. 25, 525\u2013549 (1997). https:\/\/doi.org\/10.1023\/A:1025117523902","journal-title":"Int. J. Parallel Prog."},{"issue":"2","key":"1744_CR53","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10878-012-9529-0","volume":"27","author":"DS Malyshev","year":"2014","unstructured":"Malyshev, D.S.: Boundary graph classes for some maximum induced subgraph problems. J. Combin. Optim. 27(2), 345\u2013354 (2014). https:\/\/doi.org\/10.1007\/s10878-012-9529-0","journal-title":"J. Combin. Optim."},{"issue":"2","key":"1744_CR54","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1134\/S1990478914020112","volume":"8","author":"DS Malyshev","year":"2014","unstructured":"Malyshev, D.S.: Classes of graphs critical for the edge list-ranking problem. J. Appl. Ind. Math. 8(2), 245\u2013255 (2014). https:\/\/doi.org\/10.1134\/S1990478914020112","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"1744_CR55","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s10878-015-9872-z","volume":"32","author":"DS Malyshev","year":"2016","unstructured":"Malyshev, D.S.: A complexity dichotomy and a new boundary class for the dominating set problem. J. Comb. Optim. 32(1), 226\u2013243 (2016). https:\/\/doi.org\/10.1007\/s10878-015-9872-z","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1744_CR56","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1134\/S1990478917010112","volume":"11","author":"DS Malyshev","year":"2017","unstructured":"Malyshev, D.S.: Critical elements in combinatorially closed families of graph classes. J. Appl. Ind. Math. 11(1), 99\u2013106 (2017). https:\/\/doi.org\/10.1134\/S1990478917010112","journal-title":"J. Appl. Ind. Math."},{"issue":"8","key":"1744_CR57","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1007\/s11590-015-0985-1","volume":"10","author":"DS Malyshev","year":"2016","unstructured":"Malyshev, D.S., Pardalos, P.M.: Critical hereditary graph classes: a survey. Optim. Lett. 10(8), 1593\u20131612 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0985-1","journal-title":"Optim. Lett."},{"key":"1744_CR58","doi-asserted-by":"crossref","unstructured":"McMullen,\u00a0P.: Valuations and Dissections. Handbook of Convex Geometry, vol.\u00a0B, North-Holland, Amsterdam (1993)","DOI":"10.1016\/B978-0-444-89597-4.50010-X"},{"key":"1744_CR59","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P.: The maximum number of faces of a convex polytope. Mathematika 17, 179\u2013184 (1970)","journal-title":"Mathematika"},{"key":"1744_CR60","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. Arch. Math. 31, 509\u2013516 (1978). https:\/\/doi.org\/10.1007\/BF01226481","journal-title":"Arch. Math."},{"key":"1744_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5858-8_9","volume-title":"Convexity and Its Applications","author":"P McMullen","year":"1983","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"},{"key":"1744_CR62","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovsky, A.S.: Interior Point Polynomial Methods in Convex Programming. Society for Industrial and Applied Math, USA (1994)"},{"key":"1744_CR63","doi-asserted-by":"crossref","unstructured":"Paat,\u00a0J., Schl\u00f6ter,\u00a0M., Weismantel,\u00a0R.: The integrality number of an integer program (2019). arXiv:1904.06874","DOI":"10.1007\/978-3-030-45771-6_26"},{"key":"1744_CR64","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). https:\/\/doi.org\/10.1007\/s10107-018-1323-z","journal-title":"Math. Program."},{"issue":"4","key":"1744_CR65","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s006070050042","volume":"63","author":"U Pferschy","year":"1999","unstructured":"Pferschy, U.: Dynamic programming revisited: improving knapsack algorithms. Computing 63(4), 419\u2013430 (1999). https:\/\/doi.org\/10.1007\/s006070050042","journal-title":"Computing"},{"key":"1744_CR66","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"key":"1744_CR67","doi-asserted-by":"publisher","unstructured":"Seb\u00f6,\u00a0A.: An introduction to empty lattice simplices. In: Cornu\u00e9jols G., Burkard R.E., Woeginger G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol. 1610, pp. 400\u2013414 (1999). https:\/\/doi.org\/10.1007\/3-540-48777-8_30","DOI":"10.1007\/3-540-48777-8_30"},{"key":"1744_CR68","doi-asserted-by":"crossref","unstructured":"Shevchenko,\u00a0V.N.: Qualitative topics in integer linear programming (translations of mathematical monographs) (1996) AMS Book","DOI":"10.1090\/mmono\/156"},{"key":"1744_CR69","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1134\/S1990478908010122","volume":"2","author":"VN Shevchenko","year":"2008","unstructured":"Shevchenko, V.N., Gruzdev, D.V.: A modification of the Fourier\u2013Motzkin algorithm for constructing a triangulation and star development. J. Appl. Ind. Math. 2, 113\u2013124 (2008). https:\/\/doi.org\/10.1134\/S1990478908010122","journal-title":"J. Appl. Ind. Math."},{"key":"1744_CR70","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 1. Cambridge University Press, Cambridge (1986)"},{"key":"1744_CR71","doi-asserted-by":"publisher","unstructured":"Storjohann,\u00a0A., Labahn,\u00a0G.: Asymptotically fast computation of Hermite normal forms of integer matrices. In: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 259\u2013266 (1996). https:\/\/doi.org\/10.1145\/236869.237083","DOI":"10.1145\/236869.237083"},{"key":"1744_CR72","doi-asserted-by":"crossref","unstructured":"Storjohann,\u00a0A.: Near optimal algorithms for computing Smith normal forms of integer matrices. Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, pp. 267\u2013274 (1996) 0.1145\/236869.237084","DOI":"10.1145\/236869.237084"},{"issue":"2","key":"1744_CR73","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250\u2013256 (1986). https:\/\/doi.org\/10.1287\/opre.34.2.250","journal-title":"Oper. Res."},{"issue":"2","key":"1744_CR74","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":"1744_CR75","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, 37\u201366 (2007). https:\/\/doi.org\/10.1007\/s00453-006-1231-0","journal-title":"Algorithmica"},{"key":"1744_CR76","doi-asserted-by":"crossref","unstructured":"Veselov,\u00a0S.I., Shevchenko,\u00a0V.N.: Estimates of minimal distance between point of some integral lattices. In: Combinatorial-Algebraic Methods in Applied Mathematics, pp. 26\u201333, Gorky state university (1980 in Russian)","DOI":"10.1002\/mma.1670020104"},{"issue":"2","key":"1744_CR77","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"SI Veselov","year":"2009","unstructured":"Veselov, S.I., Chirkov, A.J.: Integer program with bimodular matrix. Discret. Optim. 6(2), 220\u2013222 (2009). https:\/\/doi.org\/10.1016\/j.disopt.2008.12.002","journal-title":"Discret. Optim."},{"issue":"4","key":"1744_CR78","first-page":"25","volume":"15","author":"SI Veselov","year":"2008","unstructured":"Veselov, S.I., Shevchenko, V.N.: On the minor characteristics of orthogonal integer lattices. Diskretn. Anal. Issled. Oper. 15(4), 25\u201329 (2008). (in Russian)","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"1744_CR79","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2019.10.006","volume":"283","author":"SI Veselov","year":"2020","unstructured":"Veselov, S.I., Gribanov, D.V., Zolotykh, NYu., Chirkov, AYu.: A polynomial algorithm for minimizing discrete convic functions in fixed dimension. Discret. Appl. Math. 283, 11\u201319 (2020). https:\/\/doi.org\/10.1016\/j.dam.2019.10.006","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1744_CR80","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/0114068","volume":"14","author":"RO Winder","year":"1966","unstructured":"Winder, R.O.: Partitions of N-space by hyperplanes. SIAM J. Appl. Math. 14(4), 811\u2013818 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"1744_CR81","unstructured":"Zhendong,\u00a0W.: Computing the Smith forms of integer matrices and solving related problems. University of Delaware Newark, USA (2005)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01744-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01744-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01744-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T13:46:10Z","timestamp":1725111970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01744-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":82,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1744"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01744-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,25]]},"assertion":[{"value":"7 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}