{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:12:22Z","timestamp":1773087142774,"version":"3.50.1"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T00:00:00Z","timestamp":1652140800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T00:00:00Z","timestamp":1652140800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["21-11-00194"],"award-info":[{"award-number":["21-11-00194"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Basic Research Program at the National Research University Higher School of Economics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10898-022-01165-9","type":"journal-article","created":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T06:02:54Z","timestamp":1652162574000},"page":"591-651","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On $$\\Delta $$-modular integer linear problems in the canonical form and equivalent problems"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4005-9483","authenticated-orcid":false,"given":"Dmitry","family":"Gribanov","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Shumilov","sequence":"additional","affiliation":[]},{"given":"Dmitry","family":"Malyshev","sequence":"additional","affiliation":[]},{"given":"Panos","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,10]]},"reference":[{"key":"1165_CR1","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1998)"},{"key":"1165_CR2","doi-asserted-by":"publisher","unstructured":"Storjohann, A., Labahn, G.: Asymptotically fast computation of Hermite normal forms of integer matrices. In: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation. ISSAC \u201996, pp. 259\u2013266. Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/236869.237083","DOI":"10.1145\/236869.237083"},{"key":"1165_CR3","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1007\/s10878-018-0264-z","volume":"35","author":"VD Gribanov","year":"2018","unstructured":"Gribanov, V.D., Malyshev, S.D., Pardalos, M.P., Veselov, I.S.: FPT-algorithms for some problems related to integer programming. J. Comb. Optim. 35, 1128\u20131146 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0264-z","journal-title":"J. Comb. Optim."},{"key":"1165_CR4","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, NY, USA (1996). https:\/\/doi.org\/10.1145\/236869.237084","DOI":"10.1145\/236869.237084"},{"key":"1165_CR5","volume-title":"Computing the Smith Forms of Integer Matrices and Solving Related Problems","author":"W Zhendong","year":"2005","unstructured":"Zhendong, W.: Computing the Smith Forms of Integer Matrices and Solving Related Problems. University of Delaware, Newark (2005)"},{"key":"1165_CR6","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s11590-016-1048-y","volume":"10","author":"VD Gribanov","year":"2016","unstructured":"Gribanov, V.D., Chirkov, Y.A.: The width and integer optimization on simplices with bounded minors of the constraint matrices. Optim. Lett. 10, 1179\u20131189 (2016). https:\/\/doi.org\/10.1007\/s11590-016-1048-y","journal-title":"Optim. Lett."},{"issue":"4","key":"1165_CR7","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. Symbolic computation in algebra and geometry. J. Symb. Comput. 38(4), 1273\u20131302 (2004). https:\/\/doi.org\/10.1016\/j.jsc.2003.04.003","journal-title":"J. Symb. Comput."},{"issue":"3","key":"1165_CR8","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1137\/17M1162792","volume":"28","author":"I Aliev","year":"2018","unstructured":"Aliev, I., De Loera, J.A., Eisenbrand, F., Oertel, T., Weismantel, R.: The support of integer optimal solutions. SIAM J. Optim. 28(3), 2152\u20132157 (2018). https:\/\/doi.org\/10.1137\/17M1162792","journal-title":"SIAM J. Optim."},{"key":"1165_CR9","doi-asserted-by":"publisher","unstructured":"Berndt, S., Jansen, K., Klein, K.-M.: New bounds for the vertices of the integer hull, pp. 25\u201336. https:\/\/doi.org\/10.1137\/1.9781611976496.3","DOI":"10.1137\/1.9781611976496.3"},{"key":"1165_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-53262-8_10","volume-title":"Combinatorial Optimization","author":"J Lee","year":"2020","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Improving proximity bounds using sparsity. In: Ba\u00efou, M., Gendron, B., G\u00fcnl\u00fck, O., Mahjoub, A.R. (eds.) Combinatorial Optimization, pp. 115\u2013127. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53262-8_10"},{"key":"1165_CR11","unstructured":"Jansen, K., Rohwedder, L.: On integer programming, discrepancy, and convolution (2018). arXiv:1803.04744"},{"issue":"2","key":"1165_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0195-6698(86)80041-5","volume":"7","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Spencer, J., Vesztergombi, K.: Discrepancy of set-systems and matrices. Eur. J. Comb. 7(2), 151\u2013160 (1986). https:\/\/doi.org\/10.1016\/S0195-6698(86)80041-5","journal-title":"Eur. J. Comb."},{"issue":"2","key":"1165_CR13","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1090\/S0002-9947-1985-0784009-0","volume":"289","author":"J Spencer","year":"1985","unstructured":"Spencer, J.: Six standard deviations suffice. Trans. Am. Math. Soc. 289(2), 679\u2013706 (1985). https:\/\/doi.org\/10.1090\/S0002-9947-1985-0784009-0","journal-title":"Trans. Am. Math. Soc."},{"key":"1165_CR14","doi-asserted-by":"publisher","DOI":"10.1145\/3397484","author":"D Knop","year":"2020","unstructured":"Knop, D., Pilipczuk, M., Wrochna, M.: Tight complexity lower bounds for integer linear programming with few constraints. ACM Trans. Comput. Theory (2020). https:\/\/doi.org\/10.1145\/3397484","journal-title":"ACM Trans. Comput. Theory"},{"key":"1165_CR15","doi-asserted-by":"publisher","DOI":"10.1145\/3340322","author":"F Eisenbrand","year":"2019","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. ACM Trans. Algorithms (2019). https:\/\/doi.org\/10.1145\/3340322","journal-title":"ACM Trans. Algorithms"},{"key":"1165_CR16","doi-asserted-by":"crossref","unstructured":"Lee, J., Paat, J., Stallknecht, I., Xu, L.: Polynomial upper bounds on the number of differing columns of an integer program. arXiv preprint arXiv:2105.08160v2 [math.OC] (2021)","DOI":"10.1287\/moor.2022.1339"},{"key":"1165_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-17953-3_26","volume-title":"Integer Programming and Combinatorial Optimization","author":"T Oertel","year":"2019","unstructured":"Oertel, T., Paat, J., Weismantel, R.: Sparsity of integer solutions in the average case. In: Lodi, A., Nagarajan, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 341\u2013353. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_26"},{"issue":"3","key":"1165_CR18","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/19M1275954","volume":"4","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. 4(3), 422\u2013440 (2020). https:\/\/doi.org\/10.1137\/19M1275954","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"1165_CR19","first-page":"17","volume":"8","author":"SI Veselov","year":"2001","unstructured":"Veselov, S.I.: A proof of a generalization of the Borosh\u2013Treybig conjecture on diophantine equations. Diskretnyi Analiz i Issledovanie Operatsii 8(1), 17\u201322 (2001). (in Russian)","journal-title":"Diskretnyi Analiz i Issledovanie Operatsii"},{"key":"1165_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01744-x","author":"DV Gribanov","year":"2021","unstructured":"Gribanov, D.V., Zolotykh, Y.N.: On lattice point counting in $$\\delta $$-modular polyhedra. Optim. Lett. (2021). https:\/\/doi.org\/10.1007\/s11590-021-01744-x","journal-title":"Optim. Lett."},{"issue":"2","key":"1165_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","volume":"55","author":"I Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.B.: Bounds on positive integral solutions of linear diophantine equations. Proc. Am. Math. Soc. 55(2), 299\u2013304 (1976). https:\/\/doi.org\/10.1090\/S0002-9939-1976-0396605-3","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"1165_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.4153\/CMB-1979-045-2","volume":"22","author":"I Borosh","year":"1979","unstructured":"Borosh, I., Treybig, L.: Bounds on positive integral solutions of linear diophantine equations II. Can. Math. Bull. 22(3), 357\u2013361 (1979). https:\/\/doi.org\/10.4153\/CMB-1979-045-2","journal-title":"Can. Math. Bull."},{"issue":"5","key":"1165_CR23","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). https:\/\/doi.org\/10.1016\/j.orl.2016.07.004","journal-title":"Oper. Res. Lett."},{"key":"1165_CR24","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/FOCS.2011.31","DOI":"10.1109\/FOCS.2011.31"},{"key":"1165_CR25","unstructured":"Dadush, D.: Integer programming, lattice algorithms, and deterministic volume estimation. Georgia Institute of Technology, ProQuest Dissertations Publishing, Ann Arbor (2012)"},{"key":"1165_CR26","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"RL Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Boston (1994)"},{"key":"1165_CR27","doi-asserted-by":"crossref","unstructured":"Basu, A., Jiang, H.: Enumerating integer points in polytopes with bounded subdeterminants. arXiv preprint arXiv:2102.09994 (2021)","DOI":"10.1137\/21M139935X"},{"issue":"2","key":"1165_CR28","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"},{"key":"1165_CR29","volume-title":"Convex Polytopes. Graduate Texts in Mathematics","author":"B Gr\u00fcnbaum","year":"2011","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Graduate Texts in Mathematics. Springer, New York (2011)"},{"key":"1165_CR30","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1134\/S1990478908040157","volume":"2","author":"IS Veselov","year":"2008","unstructured":"Veselov, I.S., Chirkov, Y.A.: Some estimates for the number of vertices of integer polyhedra. J. Appl. Ind. Math. 2, 591\u2013604 (2008). https:\/\/doi.org\/10.1134\/S1990478908040157","journal-title":"J. Appl. Ind. Math."},{"key":"1165_CR31","first-page":"118","volume":"1","author":"IS Veselov","year":"2008","unstructured":"Veselov, I.S., Chirkov, Y.A.: On the vertices of implicitly defined integer polyhedra. Vestnik of Lobachevsky University of Nizhni Novgorod 1, 118\u2013123 (2008). (in Russian)","journal-title":"Vestnik of Lobachevsky University of Nizhni Novgorod"},{"key":"1165_CR32","first-page":"166","volume":"2","author":"YA Chirkov","year":"2008","unstructured":"Chirkov, Y.A., Veselov, I.S.: On the vertices of implicitly defined integer polyhedra (part 2). Vestnik of Lobachevsky University of Nizhni Novgorod 2, 166\u2013172 (2008). (in Russian)","journal-title":"Vestnik of Lobachevsky University of Nizhni Novgorod"},{"issue":"1","key":"1165_CR33","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"W Cook","year":"1992","unstructured":"Cook, W., Hartmann, M., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27\u201337 (1992). https:\/\/doi.org\/10.1007\/BF01191202","journal-title":"Combinatorica"},{"issue":"3","key":"1165_CR34","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\u2013261 (1986). https:\/\/doi.org\/10.1007\/BF01582230","journal-title":"Math. Program."},{"issue":"2","key":"1165_CR35","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. Natl. Acad. Sci. 53(2), 260\u2013265 (1965). https:\/\/doi.org\/10.1073\/pnas.53.2.260","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1165_CR36","volume-title":"Integer Programming and Network Flows","author":"CT Hu","year":"1970","unstructured":"Hu, C.T.: Integer Programming and Network Flows. Addison-Wesley Publishing Company, London (1970)"},{"key":"1165_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2020.100596","author":"G Tom\u00e1\u0161","year":"2020","unstructured":"Tom\u00e1\u0161, G., Martin, K., Du\u0161an, K.: Integer programming in parameterized complexity: five miniatures. Discrete Optim. (2020). https:\/\/doi.org\/10.1016\/j.disopt.2020.100596","journal-title":"Discrete Optim."},{"key":"1165_CR38","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.-M., Kouteck\u1ef3, M., Levin, A., Onn, S.: An algorithmic theory of integer programming (2019). arXiv:1904.01361"},{"issue":"1","key":"1165_CR39","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"GL Khachiyan","year":"1980","unstructured":"Khachiyan, G.L.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53\u201372 (1980). https:\/\/doi.org\/10.1016\/0041-5553(80)90061-0","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1165_CR40","volume-title":"Handbook of Global Optimization","author":"R Horst","year":"2013","unstructured":"Horst, R., Pardalos, M.P.: Handbook of Global Optimization. Springer, Boston (2013)"},{"key":"1165_CR41","doi-asserted-by":"publisher","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing. STOC \u201984, pp. 302\u2013311. Association for Computing Machinery, New York, NY, USA (1984). https:\/\/doi.org\/10.1145\/800057.808695","DOI":"10.1145\/800057.808695"},{"key":"1165_CR42","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"1165_CR43","doi-asserted-by":"crossref","unstructured":"Veselov, I.S., Shevchenko, N.V.: Estimates of minimal distance between point of some integral lattices. In: Combinatorial-Algebraic Methods in Applied Mathematics, pp. 26\u201333 (1980). (in Russian)","DOI":"10.1002\/mma.1670020104"},{"key":"1165_CR44","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/156","volume-title":"Qualitative Topics in Integer Linear Programming","author":"VN Shevchenko","year":"1996","unstructured":"Shevchenko, V.N.: Qualitative Topics in Integer Linear Programming. American Mathematical Society, Providence (1996)"},{"key":"1165_CR45","doi-asserted-by":"crossref","unstructured":"Glanzer, C., Stallknecht, I., Weismantel, R.: Notes on $$\\{a, b, c\\}$$-modular matrices (2021). arXiv:2106.14980","DOI":"10.1007\/978-3-030-73879-2_17"},{"issue":"4","key":"1165_CR46","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. Diskretnyi Analiz i Issledovanie Operatsii 15(4), 25\u201329 (2008). (in Russian)","journal-title":"Diskretnyi Analiz i Issledovanie Operatsii"},{"key":"1165_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01651-0","author":"J Paat","year":"2021","unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: The integrality number of an integer program. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01651-0","journal-title":"Math. Program."},{"issue":"4","key":"1165_CR48","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0167-6377(93)90041-E","volume":"13","author":"N Megiddo","year":"1993","unstructured":"Megiddo, N., Tamir, A.: Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. 13(4), 203\u2013211 (1993). https:\/\/doi.org\/10.1016\/0167-6377(93)90041-E","journal-title":"Oper. Res. Lett."},{"key":"1165_CR49","doi-asserted-by":"publisher","unstructured":"Gribanov, D. V.: An FPTAS for the $$\\Delta $$-Modular Multidimensional Knapsack Problem. In: Pardalos, P., Khachay, M., Kazakov, A. (eds.) Mathematical Optimization Theory and Operations Research. MOTOR 2021. Lecture Notes in Computer Science, vol 12755. Springer, Cham. (2021). https:\/\/doi.org\/10.1007\/978-3-030-77876-7_6","DOI":"10.1007\/978-3-030-77876-7_6"},{"key":"1165_CR50","unstructured":"Polak, A., Rohwedder, L., Wegrzycki, K.: Knapsack and subset sum with small items. arXiv:2105.04035v1 [cs.DS] (2021)"},{"issue":"1","key":"1165_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3103\/S0278641919010084","volume":"43","author":"VD Gribanov","year":"2016","unstructured":"Gribanov, V.D., Malyshev, S.D., Veselov, I.S.: FPT-algorithm for computing the width of a simplex given by a convex hull. Mosc. Univ. Comput. Math. Cybern. 43(1), 1\u201311 (2016). https:\/\/doi.org\/10.3103\/S0278641919010084","journal-title":"Mosc. Univ. Comput. Math. Cybern."},{"key":"1165_CR52","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Lewenstein, M.: Clustered integer 3sum via additive combinatorics. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing. STOC \u201915, pp. 31\u201340. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746568","DOI":"10.1145\/2746539.2746568"},{"issue":"5","key":"1165_CR53","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1137\/15M1024524","volume":"47","author":"RR Williams","year":"2018","unstructured":"Williams, R.R.: Faster all-pairs shortest paths via circuit complexity. SIAM J. Comput. 47(5), 1965\u20131985 (2018). https:\/\/doi.org\/10.1137\/15M1024524","journal-title":"SIAM J. Comput."},{"key":"1165_CR54","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-019-01392-1","volume":"182","author":"I Aliev","year":"2019","unstructured":"Aliev, I., Henk, M., Oertel, T.: Distances to lattice points in knapsack polyhedra. Math. Program. 182, 175\u2013198 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01392-1","journal-title":"Math. Program."},{"key":"1165_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01657-8","author":"I Aliev","year":"2021","unstructured":"Aliev, I., Averkov, G., De Loera, J.A., Oertel, T.: Sparse representation of vectors in lattices and semigroups. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01657-8","journal-title":"Math. Program."},{"issue":"1","key":"1165_CR56","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1137\/20M1353228","volume":"31","author":"I Aliev","year":"2021","unstructured":"Aliev, I., Celaya, M., Henk, M., Williams, A.: Distance-sparsity transference for vertices of corner polyhedra. SIAM J. Optim. 31(1), 200\u2013216 (2021). https:\/\/doi.org\/10.1137\/20M1353228","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1165_CR57","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-007-0162-8","volume":"48","author":"S Bocker","year":"2007","unstructured":"Bocker, S., Lipt\u00e1k, Z.: A fast and simple algorithm for the money changing problem. Algorithmica 48(4), 413\u2013432 (2007). https:\/\/doi.org\/10.1007\/s00453-007-0162-8","journal-title":"Algorithmica"},{"key":"1165_CR58","doi-asserted-by":"crossref","unstructured":"Klein, K.-M.: On the fine-grained complexity of the unbounded subsetsum and the Frobenius problem. arXiv:2108.05581v1 [cs.DS] (2021)","DOI":"10.1137\/1.9781611977073.141"},{"issue":"4","key":"1165_CR59","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"},{"issue":"2","key":"1165_CR60","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. Discrete Optim. 6(2), 220\u2013222 (2009). https:\/\/doi.org\/10.1016\/j.disopt.2008.12.002","journal-title":"Discrete Optim."},{"key":"1165_CR61","doi-asserted-by":"publisher","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. STOC 2017, pp. 1206\u20131219. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3055399.3055473","DOI":"10.1145\/3055399.3055473"},{"issue":"1","key":"1165_CR62","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1134\/S1990478911010029","volume":"5","author":"EV Alekseev","year":"2011","unstructured":"Alekseev, E.V., Zakharova, V.D.: Independent sets in the graphs with bounded minors of the extended incidence matrix. J. Appl. Ind. Math. 5(1), 14\u201318 (2011). https:\/\/doi.org\/10.1134\/S1990478911010029","journal-title":"J. Appl. Ind. Math."},{"key":"1165_CR63","unstructured":"Fiorini, S., Joret, G., Weltge, S., Yuditsky, Y.: Integer programs with bounded subdeterminants and two nonzeros per row (2021). arXiv:2106.05947"},{"key":"1165_CR64","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.disopt.2018.03.002","volume":"29","author":"DS Malyshev","year":"2018","unstructured":"Malyshev, D.S., Gribanov, D.V.: The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discrete Optim. 29, 103\u2013110 (2018). https:\/\/doi.org\/10.1016\/j.disopt.2018.03.002","journal-title":"Discrete Optim."},{"key":"1165_CR65","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. Discrete Appl. Math. 227, 13\u201320 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.04.025","journal-title":"Discrete Appl. Math."},{"key":"1165_CR66","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 sub-determinants and the diameter of polyhedra. Discrete Comput. Geom. 52, 102\u2013115 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9601-x","journal-title":"Discrete Comput. Geom."},{"key":"1165_CR67","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-016-1089-0","volume":"164","author":"F Eisenbrand","year":"2007","unstructured":"Eisenbrand, F., Vempala, S.: Geometric random edge. Math. Program. 164, 325\u2013339 (2007). https:\/\/doi.org\/10.1007\/s10107-016-1089-0","journal-title":"Math. Program."},{"issue":"2","key":"1165_CR68","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9 Tardos","year":"1986","unstructured":"Tardos, \u00c9.: 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."},{"key":"1165_CR69","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-09758-9_4","volume-title":"Models, Algorithms and Technologies for Network Analysis","author":"DV Gribanov","year":"2014","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, pp. 37\u201343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09758-9_4"},{"key":"1165_CR70","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11590-015-0943-y","volume":"10","author":"VD Gribanov","year":"2016","unstructured":"Gribanov, V.D., Veselov, I.S.: On integer programming with bounded determinants. Optim. Lett. 10, 1169\u20131177 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0943-y","journal-title":"Optim. Lett."},{"key":"1165_CR71","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-48777-8_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Seb\u0151","year":"1999","unstructured":"Seb\u0151, A.: An introduction to empty lattice simplices. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) Integer Programming and Combinatorial Optimization, pp. 400\u2013414. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/3-540-48777-8_30"},{"issue":"4","key":"1165_CR72","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"WH Lenstra","year":"1983","unstructured":"Lenstra, W.H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1165_CR73","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s10898-018-0729-8","volume":"73","author":"YA Chirkov","year":"2019","unstructured":"Chirkov, Y.A., Gribanov, V.D., Malyshev, S.D., Pardalos, M.P., Veselov, I.S., Zolotykh, Y.N.: 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":"1165_CR74","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, N.Y., Chirkov, A.Y.: A polynomial algorithm for minimizing discrete convic functions in fixed dimension. Discrete Appl. Math. 283, 11\u201319 (2020). https:\/\/doi.org\/10.1016\/j.dam.2019.10.006","journal-title":"Discrete Appl. Math."},{"key":"1165_CR75","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-22629-9_16","volume-title":"Mathematical Optimization Theory and Operations Research","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, pp. 218\u2013231. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22629-9_16"},{"issue":"1","key":"1165_CR76","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1134\/S199047892001007X","volume":"14","author":"VD Gribanov","year":"2020","unstructured":"Gribanov, V.D., Malyshev, S.D.: Minimization of even conic functions on the two-dimensional integral lattice. J. Appl. Ind. Math. 14(1), 56\u201372 (2020). https:\/\/doi.org\/10.1134\/S199047892001007X","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"1165_CR77","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":"1","key":"1165_CR78","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":"2","key":"1165_CR79","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. Comb. Optim. 27(2), 345\u2013354 (2014). https:\/\/doi.org\/10.1007\/s10878-012-9529-0","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1165_CR80","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1134\/S1990478914020112","volume":"8","author":"D Malyshev","year":"2014","unstructured":"Malyshev, D.: 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":"8","key":"1165_CR81","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":"1165_CR82","volume-title":"Geometry of Numbers","author":"M Gruber","year":"1987","unstructured":"Gruber, M., Lekkerkerker, G.C.: Geometry of Numbers. Elsevier Science, Amsterdam (1987)"},{"issue":"2","key":"1165_CR83","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2140\/pjm.1979.83.543","volume":"83","author":"J Vaaler","year":"1979","unstructured":"Vaaler, J.: A geometric inequality with applications to linear forms. Pac. J. Math. 83(2), 543\u2013553 (1979). https:\/\/doi.org\/10.2140\/pjm.1979.83.543","journal-title":"Pac. J. Math."},{"issue":"2","key":"1165_CR84","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0166-218X(83)90067-7","volume":"6","author":"CA Hayes","year":"1983","unstructured":"Hayes, C.A., Larman, G David: The vertices of the knapsack polytope. Discrete Appl. Math. 6(2), 135\u2013138 (1983). https:\/\/doi.org\/10.1016\/0166-218X(83)90067-7","journal-title":"Discrete Appl. Math."},{"key":"1165_CR85","unstructured":"Hartmann, M.: Cutting planes and the complexity of the integer hull. Technical Report, Cornell University Operations Research and Industrial Engineering (1988)"},{"key":"1165_CR86","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1515\/crll.1913.143.128","volume":"143","author":"E Steinitz","year":"1913","unstructured":"Steinitz, E.: Bedingt konvergente reihen und konvexe systeme. Journal f\u00fcr die reine und angewandte Mathematik 143, 128\u2013176 (1913). https:\/\/doi.org\/10.1515\/crll.1913.143.128","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"1165_CR87","first-page":"66","volume":"32","author":"S Sevast\u2019janov","year":"1978","unstructured":"Sevast\u2019janov, S.: Approximate solution of some problems of scheduling theory. Metody Diskret. Anal. 32, 66\u201375 (1978)","journal-title":"Metody Diskret. Anal."},{"issue":"2","key":"1165_CR88","first-page":"56","volume":"14","author":"VS Grinberg","year":"1980","unstructured":"Grinberg, V.S., Sevast\u2019yanov, S.V.: Value of the Steinitz constant. Funktsional\u2019nyi Analiz i ego Prilozheniya 14(2), 56\u201357 (1980)","journal-title":"Funktsional\u2019nyi Analiz i ego Prilozheniya"},{"key":"1165_CR89","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-85221-6_1","volume-title":"On the Power of Linear Dependencies","author":"I B\u00e1r\u00e1ny","year":"2008","unstructured":"B\u00e1r\u00e1ny, I.: On the Power of Linear Dependencies, pp. 31\u201345. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-85221-6_1"},{"key":"1165_CR90","doi-asserted-by":"publisher","unstructured":"Di\u00a0Summa, M., Eisenbrand, F., Faenza, Y., Moldenhauer, C.: On largest volume simplices and sub-determinants, pp. 315\u2013323. https:\/\/doi.org\/10.1137\/1.9781611973730.23","DOI":"10.1137\/1.9781611973730.23"},{"issue":"4","key":"1165_CR91","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"},{"issue":"1","key":"1165_CR92","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(1), 509\u2013516 (1978). https:\/\/doi.org\/10.1007\/BF01226481","journal-title":"Arch. Math."},{"key":"1165_CR93","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. Comb. 10, 12 (2015)","journal-title":"Online J. Anal. Comb."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01165-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01165-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01165-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T03:04:51Z","timestamp":1710990291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01165-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,10]]},"references-count":93,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1165"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01165-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,10]]},"assertion":[{"value":"28 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}