{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:19:13Z","timestamp":1768346353423,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s40314-019-0862-0","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T13:48:13Z","timestamp":1558100893000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two variations of graph test in double description method"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4542-9233","authenticated-orcid":false,"given":"Nikolai Yu.","family":"Zolotykh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3396-6154","authenticated-orcid":false,"given":"Sergei I.","family":"Bastrakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"issue":"1","key":"862_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-016-0104-z","volume":"9","author":"B Assarf","year":"2017","unstructured":"Assarf B, Gawrilow E, Herr K, Joswig M, Lorenz B, Paffenholz A, Rehn T (2017) Computing convex hulls and counting integer points with polymake. Math Programm Comput 9(1):1\u201338","journal-title":"Math Programm Comput"},{"key":"862_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-0348-8438-9_9","volume-title":"Polytopes\u2013combinatorics and computation","author":"D Avis","year":"2000","unstructured":"Avis D (2000) A revised implementation of the reverse search vertex enumeration algorithm. Polytopes\u2013combinatorics and computation. Birkh\u00e4user, Basel, pp 177\u2013198"},{"issue":"5\u20136","key":"862_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0925-7721(96)00023-5","volume":"7","author":"D Avis","year":"1997","unstructured":"Avis D, Bremner D, Seidel R (1997) How good are convex hull algorithms? Comput Geom 7(5\u20136):265\u2013301","journal-title":"Comput Geom"},{"issue":"3","key":"862_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D Avis","year":"1992","unstructured":"Avis D, Fukuda K (1992) A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput Geom 8(3):295\u2013313","journal-title":"Discrete Comput Geom"},{"issue":"1\u20132","key":"862_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara R, Hill PM, Zaffanella E (2008) The Parma polyhedra library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci Comput Programm 72(1\u20132):3\u201321","journal-title":"Sci Comput Programm"},{"issue":"4","key":"862_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"CB Barber","year":"1996","unstructured":"Barber CB, Dobkin DP, Huhdanpaa H (1996) The quickhull algorithm for convex hulls. ACM Trans Math Softw (TOMS) 22(4):469\u2013483","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"1","key":"862_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1134\/S0965542515010042","volume":"55","author":"SI Bastrakov","year":"2015","unstructured":"Bastrakov SI, Zolotykh NYu (2015) Fast method for verifying Chernikov rules in Fourier-Motzkin elimination. Comput Math Math Phys 55(1):160\u2013167","journal-title":"Comput Math Math Phys"},{"issue":"3","key":"862_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009389","volume":"20","author":"D Bremner","year":"1998","unstructured":"Bremner D, Fukuda K, Marzetta A (1998) Primal-dual methods for vertex and facet enumeration. Discrete Comput Geom 20(3):333\u2013357","journal-title":"Discrete Comput Geom"},{"key":"862_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/zamm.19560360308","volume":"36","author":"E Burger","year":"1956","unstructured":"Burger E (1956) \u00dcber homogene lineare ungleichungssysteme. Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik 36:135\u2013139","journal-title":"Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik"},{"issue":"4","key":"862_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0041-5553(64)90009-6","volume":"4","author":"NV Chernikova","year":"1964","unstructured":"Chernikova NV (1964) Algorithm for finding a general formula for the non-negative solutions of system of linear equations. U.S.S.R. Comput Math Math Phys 4(4):151\u2013158","journal-title":"U.S.S.R. Comput Math Math Phys"},{"key":"862_CR11","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT press, Cambridge, MA"},{"key":"862_CR12","doi-asserted-by":"publisher","unstructured":"Demenkov M, Filimonov N (2016) Polyhedral barrier regulator design using non-monotonic Lyapunov function. In: Proceedings of 2016 international conference on stability and oscillations of nonlinear control systems (Pyatnitskiy\u2019s Conference), STAB 2016, VA. Trapeznikov Institute of Control Sciences, Moscow. \nhttps:\/\/doi.org\/10.1109\/STAB.2016.7541176","DOI":"10.1109\/STAB.2016.7541176"},{"key":"862_CR13","unstructured":"Fern\u00e1ndez F, Quinton P (1988) Extension of Chernikova\u2019s algorithm for solving general mixed linear programming problems. Research report, RR-0943, INRIA. \nhttps:\/\/hal.inria.fr\/inria-00075615\/document\n\n. Accessed 12 May 2019"},{"key":"862_CR14","first-page":"91","volume-title":"Lecture notes in computer science","author":"K Fukuda","year":"1996","unstructured":"Fukuda K, Prodon A (1996) Double description method revisited. In: Deza M, Euler R, Manoussakis I (eds) Lecture notes in computer science, vol 1120. Springer-Verlag, New York, pp 91\u2013111"},{"key":"862_CR15","unstructured":"Genov B (2014) The convex hull problem in practice. PhD thesis, Universit\u00e4t Bremen. \nhttps:\/\/elib.suub.uni-bremen.de\/edocs\/00104422-1.pdf\n\n. Accessed 12 May 2019"},{"issue":"10","key":"862_CR16","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1016\/j.jsc.2009.04.006","volume":"44","author":"R Hemmecke","year":"2009","unstructured":"Hemmecke R, Malkin PN (2009) Computing generating sets of lattice ideals and Markov bases of lattices. J Symbol Comput 44(10):1463\u20131476","journal-title":"J Symbol Comput"},{"key":"862_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to global optimization","author":"R Horst","year":"2000","unstructured":"Horst R, Pardalos PM, Van Thoai N (2000) Introduction to global optimization. Springer, New York"},{"key":"862_CR18","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/978-3-642-02658-4_52","volume-title":"International conference on computer aided verification","author":"B Jeannet","year":"2009","unstructured":"Jeannet B, Min\u00e9 A (2009) Apron: a library of numerical abstract domains for static analysis. International conference on computer aided verification. Springer, Berlin, Heidelberg, pp 661\u2013667"},{"key":"862_CR19","volume-title":"Contributions to theory of games","author":"TS Motzkin","year":"1953","unstructured":"Motzkin TS, Raiffa H, Thompson GL, Thrall RM (1953) The double description method. In: Kuhn HW, Tucker AW (eds) Contributions to theory of games, vol 2. Princeton University Press, Princeton"},{"key":"862_CR20","doi-asserted-by":"publisher","unstructured":"Perry J (2017) Exploring the dynamic Buchberger algorithm. In: Proceedings of the 2017 ACM on international symposium on symbolic and algebraic computation ACM, pp 365\u2013372. \nhttps:\/\/doi.org\/10.1145\/3087604.3087643","DOI":"10.1145\/3087604.3087643"},{"key":"862_CR21","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver A (1998) Theory of linear and integer programming. Wiley, New York"},{"key":"862_CR22","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency, vol 24. Springer, New York"},{"key":"862_CR23","unstructured":"Terzer M (2009) Large scale methods to enumerate extreme rays and elementary modes. PhD thesis, ETH Zurich"},{"issue":"19","key":"862_CR24","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1093\/bioinformatics\/btn401","volume":"24","author":"M Terzer","year":"2008","unstructured":"Terzer M, Stelling J (2008) Large-scale computation of elementary flux modes with bit pattern trees. Bioinformatics 24(19):2229\u20132235","journal-title":"Bioinformatics"},{"key":"862_CR25","unstructured":"Le H (1992) Verge. A note on Chernikova\u2019s algorithm. Technical Report 635, IRISA, Campus de Beaulieu, Rennes, France"},{"issue":"3\u20134","key":"862_CR26","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1080\/01495730008947354","volume":"15","author":"DK Wilde","year":"2000","unstructured":"Wilde DK (2000) A library for doing polyhedral operations. Parallel Algorithms Appl 15(3\u20134):137\u2013166","journal-title":"Parallel Algorithms Appl"},{"key":"862_CR27","volume-title":"Lectures on polytopes","author":"GM Ziegler","year":"2012","unstructured":"Ziegler GM (2012) Lectures on polytopes, vol 152. Springer, New York"},{"issue":"1","key":"862_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1134\/S0965542512010162","volume":"52","author":"NYu Zolotykh","year":"2012","unstructured":"Zolotykh NYu (2012) New modification of the double description method for constructing the skeleton of a polyhedral cone. Comput Math Math Phys 52(1):146\u2013156","journal-title":"Comput Math Math Phys"},{"issue":"2","key":"862_CR29","doi-asserted-by":"publisher","first-page":"161","DOI":"10.20537\/vm180203","volume":"28","author":"NY Zolotykh","year":"2018","unstructured":"Zolotykh NY, Kubarev VK, Lyalin SS (2018) Double description method over the field of algebraic numbers. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki 28(2):161\u2013175","journal-title":"Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp\u2019yuternye Nauki"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0862-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-019-0862-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0862-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:12:51Z","timestamp":1589587971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-019-0862-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,17]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["862"],"URL":"https:\/\/doi.org\/10.1007\/s40314-019-0862-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,17]]},"assertion":[{"value":"14 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"100"}}