{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:02:51Z","timestamp":1732035771025},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,9,21]],"date-time":"2015-09-21T00:00:00Z","timestamp":1442793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"LATNA Laboratory NRU HSE RF","award":["11.G34.31.0057"],"award-info":[{"award-number":["11.G34.31.0057"]}]},{"name":"Russian Foundation for Basic Research","award":["15-01-06249 A"],"award-info":[{"award-number":["15-01-06249 A"]}]},{"name":"Russian Foundation for Basic Research","award":["15-01-06249 A"],"award-info":[{"award-number":["15-01-06249 A"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0943-y","type":"journal-article","created":{"date-parts":[[2015,10,8]],"date-time":"2015-10-08T00:32:04Z","timestamp":1444264324000},"page":"1169-1177","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On integer programming with bounded determinants"],"prefix":"10.1007","volume":"10","author":[{"given":"D. V.","family":"Gribanov","sequence":"first","affiliation":[]},{"given":"S. I.","family":"Veselov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,21]]},"reference":[{"issue":"1","key":"943_CR1","first-page":"3","volume":"17","author":"VE Alekseev","year":"2010","unstructured":"Alekseev, V.E., Zakharova, D.V.: Independence sets of graphs with bounded minors of the augmented incidence matrix. Discret. Anal. Oper. Res. 17(1), 3\u201310 (2010)","journal-title":"Discret. Anal. Oper. Res."},{"key":"943_CR2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-540-85238-4_7","volume":"5162","author":"VE Alekseev","year":"2008","unstructured":"Alekseev, V.E., Lozin, V.V., Malyshev, D.S., Milanic, M.: The maximum independent set problem in planar graphs. Lect. Notes Comput. Sci. 5162, 96\u2013107 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"943_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1134\/S1990478909010013","volume":"3","author":"VE Alekseev","year":"2009","unstructured":"Alekseev, V.E., Malyshev, D.S.: Planar graph classes with the independent set problem solvable in polynomial time. J. Appl. Ind. Math. 3, 1\u20134 (2009)","journal-title":"J. Appl. Ind. Math."},{"issue":"3","key":"943_CR4","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":"943_CR5","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 $$\\mathbb{R}^{n}$$ R n II: application of K-convexity. Discret. Comput. Geom. 16(3), 305\u2013311 (1996)","journal-title":"Discret. Comput. Geom."},{"key":"943_CR6","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":"943_CR7","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"},{"issue":"4","key":"943_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. J. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"J. Linear Algebra Appl."},{"issue":"1","key":"943_CR9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1073\/pnas.57.1.16","volume":"57","author":"RE Gomory","year":"1967","unstructured":"Gomory, R.E.: Integer faces of a polyhedron. Proc. Natl. Acad. Sci. USA 57(1), 16\u201318 (1967)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"943_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-319-09758-9_4","volume":"104","author":"DV Gribanov","year":"2013","unstructured":"Gribanov, D.V.: The flatness theorem for some class of polytopes and searching an integer point. Springer Proc. Math. Stat. Models Algorithms Technol. Netw. Anal. 104, 37\u201345 (2013)","journal-title":"Springer Proc. Math. Stat. Models Algorithms Technol. Netw. Anal."},{"key":"943_CR11","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":"943_CR12","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, USA (1970)"},{"key":"943_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2025-2","volume-title":"Handbook of Global Optimization","author":"R Horst","year":"1995","unstructured":"Horst, R., Pardalos, Panos M.: Handbook of Global Optimization. Springer, US (1995)"},{"key":"943_CR14","unstructured":"Hu, T.C.: On the Asymptotic Integer Algorithm. MRC Report 946, University of Wisconsin, Madison (1968)"},{"key":"943_CR15","doi-asserted-by":"crossref","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R Kannan","year":"1988","unstructured":"Kannan, R., Lov\u00e1sz, L.: Covering minima and lattice-point-free convex bodies. Ann. Math. 128, 577\u2013602 (1988)","journal-title":"Ann. Math."},{"key":"943_CR16","unstructured":"Kantor, J. M.: On the width of lattice-free simplexes. Cornell University Library (1997). arXiv:alg-geom\/9709026v1"},{"issue":"1","key":"943_CR17","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":"943_CR18","first-page":"113","volume":"12","author":"A Khinchine","year":"1948","unstructured":"Khinchine, A.: A quantitative formulation of Kronecker\u2019s theory of approximation. Izv. Akad. Nauk SSR Seriya Mat. 12, 113\u2013122 (1948). (in Russian)","journal-title":"Izv. Akad. Nauk SSR Seriya Mat."},{"key":"943_CR19","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. Comput. Sci. 412, 3545\u20133554 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"943_CR20","unstructured":"Kotnyek, B.: A generalization of totally unimodular and network matrices. PhD thesis. Published by ProQuest LLC 2014"},{"issue":"5","key":"943_CR21","first-page":"41","volume":"16","author":"DS Malyshev","year":"2009","unstructured":"Malyshev, D.S.: Continued sets of boundary classes of graphs for colorability problems. Discret. Anal. Oper. Res. 16(5), 41\u201351 (2009)","journal-title":"Discret. Anal. Oper. Res."},{"issue":"6","key":"943_CR22","first-page":"43","volume":"16","author":"DS Malyshev","year":"2009","unstructured":"Malyshev, D.S.: On minimal hard classes of graphs. Discret. Anal. Oper. Res. 16(6), 43\u201351 (2009)","journal-title":"Discret. Anal. Oper. Res."},{"key":"943_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1515\/dma-2013-017","volume":"23","author":"DS Malyshev","year":"2013","unstructured":"Malyshev, D.S.: The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem. Discret. Math. Appl. 23, 245\u2013249 (2013)","journal-title":"Discret. Math. Appl."},{"key":"943_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1134\/S1990478912010103","volume":"6","author":"DS Malysev","year":"2012","unstructured":"Malysev, D.S.: Analysis of the impact of the number of edges in connected graphs on the computational complexity of independent set problem. J. Appl. Ind. Math. 6, 97\u201399 (2012)","journal-title":"J. Appl. Ind. Math."},{"key":"943_CR25","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":"943_CR26","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1134\/S199047891304008X","volume":"7","author":"DS Malyshev","year":"2013","unstructured":"Malyshev, D.S.: Classes of subcubic planar graphs for which the independent set problem is polynomially solvable. J. Appl. Ind. Math. 7, 537\u2013548 (2013)","journal-title":"J. Appl. Ind. Math."},{"key":"943_CR27","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."},{"issue":"1\u20133","key":"943_CR28","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":"2","key":"943_CR29","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":"943_CR30","unstructured":"Seb\u00f6, A.: 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":"943_CR31","doi-asserted-by":"crossref","unstructured":"Shevchenko, V. N.: Qualitative Topics in Integer Linear Programming (Translations of Mathematical Monographs)156. American Mathematical Society, Providence (1996)","DOI":"10.1090\/mmono\/156"},{"key":"943_CR32","volume-title":"Theory of Linear and Integer Programming. WileyInterscience Series in Discrete Mathematics","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. WileyInterscience Series in Discrete Mathematics. Wiley, New York (1998)"},{"issue":"2","key":"943_CR33","doi-asserted-by":"crossref","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)","journal-title":"Discret. Optim."},{"key":"943_CR34","unstructured":"Yemelichev, V.A., Kovalev, M.M., Kravtsov, M.K.: Polytopes, Graphs and Optimization. Cambridge University Press, Cambridge (1984)"},{"key":"943_CR35","doi-asserted-by":"crossref","unstructured":"Ziegler, G.: Lectures on polytopes. GTM 152. Springer, New York (1996)","DOI":"10.1007\/978-1-4613-8431-1"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0943-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0943-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0943-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:29:09Z","timestamp":1589585349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0943-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,21]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["943"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0943-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,21]]}}}