{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:38:49Z","timestamp":1768347529971,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["16-31-00109-mol-a and 15-01-06249-A"],"award-info":[{"award-number":["16-31-00109-mol-a and 15-01-06249-A"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Russian Foundation for Basic Research (RU)","award":["15-01-06249-A"],"award-info":[{"award-number":["15-01-06249-A"]}]},{"name":"Russian Federation President grant","award":["MK-4819.2016.1"],"award-info":[{"award-number":["MK-4819.2016.1"]}]},{"name":"LATNA laboratory, National Research University Higher School of Economics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-016-1048-y","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T18:27:53Z","timestamp":1465842473000},"page":"1179-1189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The width and integer optimization on simplices with bounded minors of the constraint matrices"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4005-9483","authenticated-orcid":false,"given":"D. V.","family":"Gribanov","sequence":"first","affiliation":[]},{"given":"A. Y.","family":"Chirkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"key":"1048_CR1","first-page":"113","volume":"12","author":"A Khinchine","year":"1948","unstructured":"Khinchine, A.: A quantitative formulation of Kronecker\u2019s theory of approximation. Izvestiya Akademii Nauk SSR Seriya Matematika 12, 113\u2013122 (1948). (in russian)","journal-title":"Izvestiya Akademii Nauk SSR Seriya Matematika"},{"issue":"3","key":"1048_CR2","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1287\/moor.24.3.728","volume":"24","author":"W Banaszczyk","year":"1999","unstructured":"Banaszczyk, W., Litvak, A.E., Pajor, A., Szarek, S.J.: The flatness theorem for non-symmetric convex bodies via the local theory of Banach spaces. Math. Oper. Res. 24(3), 728\u2013750 (1999)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1048_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02711514","volume":"16","author":"W Banaszczyk","year":"1996","unstructured":"Banaszczyk, W.: Inequalities for convex bodies and polar reciprocal lattices in Rn II: application of K-convexity. Discrete Comput. Geom. 16(3), 305\u2013311 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"1048_CR4","unstructured":"Dadush, D.: Transference Theorems in the Geometry of Numbers. http:\/\/cs.nyu.edu\/courses\/spring13\/CSCI-GA.3033-013\/lectures\/transference.pptx . Accessed 7 Sept 2015"},{"issue":"2","key":"1048_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009842406728","volume":"4","author":"M Rudelson","year":"2000","unstructured":"Rudelson, M.: Distances between non-symmetric convex bodies and the $$MM^*$$ M M \u2217 -estimate. Positivity 4(2), 161\u2013178 (2000)","journal-title":"Positivity"},{"key":"1048_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/eujc.1999.0325","volume":"21","author":"C Haase","year":"2000","unstructured":"Haase, C., Ziegler, G.: On the maximal width of empty lattice simplices. Eur. J. Comb. 21, 111\u2013119 (2000)","journal-title":"Eur. J. Comb."},{"key":"1048_CR7","unstructured":"Kantor,\u00a0J.M.: On the Width of Lattice-Free Simplexes. Cornell University Library (1997). http:\/\/arxiv.org\/abs\/alg-geom\/9709026v1"},{"key":"1048_CR8","unstructured":"Seb\u00f6,\u00a0A.: An introduction to empty lattice simplexes. In: Cornu\u00e9jols,\u00a0G., Burkard,\u00a0R.R., Woeginger,\u00a0R.E. (eds.) LNCS, vol. 1610, pp. 400\u2013414 (1999)"},{"key":"1048_CR9","doi-asserted-by":"crossref","unstructured":"Gribanov, D.V.: The flatness theorem for some class of polytopes and searching an integer point. In: Springer Proceedings in Mathematics & Statistics. Models, Algorithms and Technologies for Network Analysis, vol. 104, pp. 37\u201345 (2013)","DOI":"10.1007\/978-3-319-09758-9_4"},{"key":"1048_CR10","doi-asserted-by":"publisher","unstructured":"Gribanov, D.V., Veselov, S.I.: On integer programming with bounded determinants. Optim. Lett. doi: 10.1007\/s11590-015-0943-y (On-line first)","DOI":"10.1007\/s11590-015-0943-y"},{"key":"1048_CR11","unstructured":"Bal\u00e1zs, K.: A Generalization of Totally Unimodular and Network Matrices. PhD thesis. ProQuest LLC (2014)"},{"issue":"1","key":"1048_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","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)","journal-title":"Comput. Math. Math. Phys."},{"key":"1048_CR13","doi-asserted-by":"crossref","unstructured":"Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Springer, New York (1995)","DOI":"10.1007\/978-1-4615-2025-2"},{"issue":"1\u20133","key":"1048_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1\u20133), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1048_CR15","first-page":"17","volume":"132","author":"E Vladimir","year":"2003","unstructured":"Vladimir, E.: Alekseev: on easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Appl. Math. 132(1\u20133), 17\u201326 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"1048_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.tcs.2007.09.013","volume":"389","author":"VE Alekseev","year":"2007","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389(1\u20132), 219\u2013236 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"1048_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2004.04.010","volume":"285","author":"VE Alekseev","year":"2004","unstructured":"Alekseev, V.E., Korobitsyn, D.V., Lozin, V.V.: Boundary classes of graphs for the dominating set problem. Discrete Math. 285(1\u20133), 1\u20136 (2004)","journal-title":"Discrete Math."},{"key":"1048_CR18","doi-asserted-by":"crossref","first-page":"3545","DOI":"10.1016\/j.tcs.2011.03.001","volume":"412","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., Lozin, V.V., Malyshev, D.S., Tiskin, A.: Boundary properties of graphs for algorithmic graph problems. Theor. Computer Sci. 412, 3545\u20133554 (2011)","journal-title":"Theor. Computer Sci."},{"issue":"5","key":"1048_CR19","first-page":"41","volume":"16","author":"DS Malyshev","year":"2009","unstructured":"Malyshev, D.S.: Continued sets of boundary classes of graphs for colorability problems. Discrete Anal. Oper. Res. 16(5), 41\u201351 (2009)","journal-title":"Discrete Anal. Oper. Res."},{"issue":"6","key":"1048_CR20","first-page":"43","volume":"16","author":"DS Malyshev","year":"2009","unstructured":"Malyshev, D.S.: On minimal hard classes of graphs. Discrete Anal. Oper. Res. 16(6), 43\u201351 (2009)","journal-title":"Discrete Anal. Oper. Res."},{"key":"1048_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1134\/S1990478913020117","volume":"2","author":"DS Malyshev","year":"2013","unstructured":"Malyshev, D.S.: A study of the boundary graph classes for colorability problems. J. Appl. Ind. Math. 2, 221\u2013228 (2013)","journal-title":"J. Appl. Ind. Math."},{"key":"1048_CR22","doi-asserted-by":"crossref","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, 245\u2013255 (2014)","journal-title":"J. Appl. Ind. Math."},{"key":"1048_CR23","doi-asserted-by":"crossref","unstructured":"Malyshev, D.S., Pardalos, P.M.: Critical hereditary graph classes: a survey. Optim. Lett. (2015)","DOI":"10.1007\/s11590-015-0985-1"},{"key":"1048_CR24","doi-asserted-by":"crossref","unstructured":"Shevchenko,\u00a0V.N.: Qualitative Topics in Integer Linear Programming (Translations of Mathematical Monographs). AMS (1996)","DOI":"10.1090\/mmono\/156"},{"key":"1048_CR25","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A Barvinok","year":"1994","unstructured":"Barvinok, A.: Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19, 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"key":"1048_CR26","first-page":"91","volume":"38","author":"A Barvinok","year":"1999","unstructured":"Barvinok, A., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. New Perspect. Algebraic Comb. 38, 91\u2013147 (1999)","journal-title":"New Perspect. Algebraic Comb."},{"key":"1048_CR27","unstructured":"Schrijver,\u00a0A.: Theory of Linear and Integer Programming. WileyInterscience Series in Discrete Mathematics. Wiley, New York (1998)"},{"key":"1048_CR28","doi-asserted-by":"crossref","unstructured":"Storjohann,\u00a0A.: Near optimal algorithms for computing Smith normal forms of integer matrices. In: ISSAC\u201996 Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, pp. 267\u2013274. ACM Press (1996)","DOI":"10.1145\/236869.237084"},{"key":"1048_CR29","unstructured":"Zhendong,\u00a0W.: Computing the Smith Forms of Integer Matrices and Solving Related Problems (2005)"},{"key":"1048_CR30","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, Boston (1970)"},{"issue":"2","key":"1048_CR31","doi-asserted-by":"crossref","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)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"1048_CR32","doi-asserted-by":"crossref","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. Assoc. Comput. Mach. 28, 765\u2013768 (1981)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1048-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1048-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1048-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:56:17Z","timestamp":1568037377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1048-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["1048"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1048-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,13]]}}}