{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:48Z","timestamp":1740145188871,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education","doi-asserted-by":"crossref","award":["075-02-2020-1483\/1"],"award-info":[{"award-number":["075-02-2020-1483\/1"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"crossref"}]}],"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-01729-w","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T12:26:08Z","timestamp":1618489568000},"page":"2177-2189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to\u00a0find the\u00a0convex hull of\u00a0all\u00a0integer points in\u00a0a\u00a0polyhedron?"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1498-3250","authenticated-orcid":false,"given":"S. O.","family":"Semenov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4542-9233","authenticated-orcid":false,"given":"N. Yu.","family":"Zolotykh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"1729_CR1","unstructured":"Baldoni, V., Berline, N., De Loera, J.A., Dutra, B., K\u00f6ppe, M., Moreinis, S., Pinto, G., Vergne, M. and Wu, J.: A User\u2019s Guide for LattE integrale v1. 7.2 (2013) Software package LattE is available at http:\/\/www.math.ucdavis.edu\/~latte"},{"issue":"4","key":"1729_CR2","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19(4), 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"key":"1729_CR3","doi-asserted-by":"publisher","unstructured":"Bastrakov, S.I., Churkin, A.V., Zolotykh, N.Y.: Accelerating Fourier-Motzkin elimination using bit pattern trees. Optim. Methods Softw. (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1712600","DOI":"10.1080\/10556788.2020.1712600"},{"issue":"1","key":"1729_CR4","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1134\/S0965542515010042","volume":"55","author":"SI Bastrakov","year":"2015","unstructured":"Bastrakov, S.I., Zolotykh, N.Y.: Fast method for verifying Chernikov rules in Fourier\u2013Motzkin elimination. Comput. Math. Math. Phys. 55(1), 160\u2013167 (2015)","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"1729_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/2480359.2429078","volume":"48","author":"AM Ben-Amram","year":"2013","unstructured":"Ben-Amram, A.M., Genaim, S.: On the linear ranking problem for integer linear-constraint loops. ACM SIGPLAN Not. 48(1), 51\u201362 (2013)","journal-title":"ACM SIGPLAN Not."},{"issue":"4","key":"1729_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629488","volume":"61","author":"AM Ben-Amram","year":"2014","unstructured":"Ben-Amram, A.M., Genaim, S.: Ranking functions for linear-constraint loops. J. ACM (JACM) 61(4), 1\u201355 (2014)","journal-title":"J. ACM (JACM)"},{"issue":"5","key":"1729_CR7","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1016\/j.jalgebra.2010.01.031","volume":"324","author":"W Bruns","year":"2010","unstructured":"Bruns, W., Ichim, B.: Normaliz: Algorithms for affine monoids and rational cones. J. Algebra 324(5), 1098\u20131113 (2010)","journal-title":"J. Algebra"},{"key":"1729_CR8","unstructured":"Bruns, W., Ichim, B., R\u00f6mer, T., Sieg, R. and S\u00f6ger, C.: Normaliz. Algorithms for rational cones and affine monoids. Available at https:\/\/www.normaliz.uni-osnabrueck.de"},{"key":"1729_CR9","unstructured":"Chernikov, S.: Linear inequalities. Nauka, Moscow (1968). (in Russian)"},{"issue":"2","key":"1729_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","volume":"5","author":"N Chernikova","year":"1965","unstructured":"Chernikova, N.: Algorithm for finding a general formula for the non-negative solutions of system of linear inequalities. U.S.S.R. Comput. Math. Math. Phys. 5(2), 228\u2013233 (1965)","journal-title":"U.S.S.R. Comput. Math. Math. Phys."},{"issue":"1","key":"1729_CR11","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)","journal-title":"Combinatorica"},{"issue":"4","key":"1729_CR12","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. Symb. Comput. 38(4), 1273\u20131302 (2004)","journal-title":"J. Symb. Comput."},{"key":"1729_CR13","unstructured":"Hartmann, M.: Cutting planes and the complexity of the integer hull. Technical Report No.\u00a0819. Cornell University, School of Operations Research and Industrial Engineering (1988)"},{"key":"1729_CR14","volume-title":"Integer Programming and Network Flows","author":"TC Hu","year":"1969","unstructured":"Hu, T.C.: Integer Programming and Network Flows. Department of Computer Science, Wisconsin University, Madison (1969)"},{"key":"1729_CR15","unstructured":"K\u00f6ppe, M., Verdoolaege, S, Woods, K. M.: An implementation of the Barvinok\u2013Woods integer projection algorithm. In: The 2008 International Conference on Information Theory and Statistical Learning, pp. 53\u201359 (2008)"},{"key":"1729_CR16","volume-title":"Contributions to Theory of Games","author":"T Motzkin","year":"1953","unstructured":"Motzkin, T., Raiffa, H., Thompson, G., Thrall, R.: The double description method. In: Kuhn, H., Tucker, A.W. (eds.) Contributions to Theory of Games, vol. 2. Princeton University Press, Princeton, RI (1953)"},{"issue":"4","key":"1729_CR17","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s11590-009-0131-z","volume":"3","author":"AJ Schaefer","year":"2009","unstructured":"Schaefer, A.J.: Inverse integer programming. Optim. Lett. 3(4), 483\u2013489 (2009)","journal-title":"Optim. Lett."},{"key":"1729_CR18","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":"1729_CR19","doi-asserted-by":"crossref","unstructured":"Semenov, S., Zolotykh N. Yu.: A dynamic algorithm for constructing the dual representation of a polyhedral cone. In: International Conference on Mathematical Optimization Theory and Operations Research. Lecture Notes in Computer Science 11548. Springer, Cham. pp. 59\u201369 (2019)","DOI":"10.1007\/978-3-030-22629-9_5"},{"key":"1729_CR20","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, USA (1996)"},{"issue":"1","key":"1729_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1134\/S0965542512010162","volume":"52","author":"N Zolotykh","year":"2012","unstructured":"Zolotykh, N.: New modification of the double description method for constructing the skeleton of a polyhedral cone. Comput. Math. Math. Phys. 52(1), 146\u2013156 (2012)","journal-title":"Comput. Math. Math. Phys."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01729-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01729-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01729-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T12:13:16Z","timestamp":1659615196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01729-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,15]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1729"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01729-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,4,15]]},"assertion":[{"value":"10 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}