{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T03:28:21Z","timestamp":1773890901332,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T00:00:00Z","timestamp":1763596800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","award":["IT42541"],"award-info":[{"award-number":["IT42541"]}],"id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101267"],"award-info":[{"award-number":["12101267"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271516"],"award-info":[{"award-number":["12271516"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.jsc.2025.102527","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:37:07Z","timestamp":1763537827000},"page":"102527","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient detection of redundancies in systems of linear inequalities"],"prefix":"10.1016","volume":"135","author":[{"given":"Rui-Juan","family":"Jing","sequence":"first","affiliation":[]},{"given":"Marc","family":"Moreno Maza","sequence":"additional","affiliation":[]},{"given":"Chirantan","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Yan-Feng","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Chun-Ming","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jsc.2025.102527_br0010","series-title":"Handbook of Satisfiability, vol. 185","author":"Biere","year":"2009"},{"issue":"2","key":"10.1016\/j.jsc.2025.102527_br0020","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1023\/A:1018368920203","article-title":"Projection with a minimal system of inequalities","volume":"10","author":"Balas","year":"1998","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.jsc.2025.102527_br0030","series-title":"Handbook of Model Checking","first-page":"305","article-title":"Satisfiability modulo theories","author":"Barrett","year":"2018"},{"key":"10.1016\/j.jsc.2025.102527_br0040","series-title":"Proceedings of PACT'o4","first-page":"7","article-title":"Code generation in the polyhedral model is easier than you think","author":"Bastoul","year":"2004"},{"issue":"2","key":"10.1016\/j.jsc.2025.102527_br0050","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0041-5553(65)90045-5","article-title":"Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities","volume":"5","author":"Chernikova","year":"1965","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"7","key":"10.1016\/j.jsc.2025.102527_br0060","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1109\/TIT.2008.924720","article-title":"On the Han-Kobayashi region for the Interference channel","volume":"54","author":"Chong","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jsc.2025.102527_br0070","series-title":"Foundations of Computer Science, 1994 Proceedings, 35th Annual Symposium on","first-page":"695","article-title":"More output-sensitive geometric algorithms","author":"Clarkson","year":"1994"},{"issue":"3","key":"10.1016\/j.jsc.2025.102527_br0080","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","article-title":"Fourier-Motzkin elimination and its dual","volume":"14","author":"Dantzig","year":"1973","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jsc.2025.102527_br0090","author":"Dutertre"},{"key":"10.1016\/j.jsc.2025.102527_br0100","doi-asserted-by":"crossref","DOI":"10.1007\/BF01407931","article-title":"Dataflow analysis of array and scalar references","volume":"20","author":"Feautrier","year":"1991","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/j.jsc.2025.102527_br0110","series-title":"The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications","first-page":"79","article-title":"Automatic parallelization in the polytope model","author":"Feautrier","year":"1996"},{"issue":"2","key":"10.1016\/j.jsc.2025.102527_br0120","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TIT.2012.2222863","article-title":"Entropic inequalities and marginal problems","volume":"59","author":"Fritz","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jsc.2025.102527_br0130","series-title":"The CDD and CDDplus Homepage","author":"Fukuda","year":"2022"},{"key":"10.1016\/j.jsc.2025.102527_br0140","series-title":"Combinatorics and Computer Science","first-page":"91","article-title":"Double description method revisited","author":"Fukuda","year":"1996"},{"issue":"6","key":"10.1016\/j.jsc.2025.102527_br0150","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/(SICI)1096-9128(199607)8:6<445::AID-CPE253>3.0.CO;2-G","article-title":"Scanning parameterized polyhedron using Fourier-Motzkin elimination","volume":"8","author":"Le Fur","year":"1996","journal-title":"Concurrency"},{"key":"10.1016\/j.jsc.2025.102527_br0160","author":"Gattegno"},{"key":"10.1016\/j.jsc.2025.102527_br0280","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10479-016-2385-z","article-title":"Combinatorial redundancy detection","volume":"265","author":"G\u00e4rtner","year":"2018","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.jsc.2025.102527_br0170","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02284624","article-title":"Consistency, redundancy, and implied equalities in linear systems","volume":"17","author":"Greenberg","year":"1996","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.jsc.2025.102527_br0180","series-title":"First International Workshop on Polyhedral Compilation Techniques (IMPACT'11)","article-title":"Polly - polyhedral optimization in LLVM","author":"Grosser","year":"2011"},{"issue":"11","key":"10.1016\/j.jsc.2025.102527_br0190","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1016\/j.jsc.2005.09.012","article-title":"Quantifier elimination in automatic loop parallelization","volume":"41","author":"Gr\u00f6\u00dflinger","year":"2006","journal-title":"J. Symb. Comput."},{"issue":"8","key":"10.1016\/j.jsc.2025.102527_br0200","doi-asserted-by":"crossref","first-page":"4799","DOI":"10.1109\/TIT.2023.3263178","article-title":"Proving information inequalities and identities with symbolic computation","volume":"69","author":"Guo","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.jsc.2025.102527_br0210","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01535523","article-title":"Practical issues on the projection of polyhedral sets","volume":"6","author":"Huynh","year":"1992","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.jsc.2025.102527_br0490","series-title":"Proceedings of ICMS 2010","first-page":"209","article-title":"Introduction to normaliz 2.5","volume":"vol. 6327","author":"Ichim","year":"2010"},{"key":"10.1016\/j.jsc.2025.102527_br0220","series-title":"Principles and Practice of Constraint Programming, PPCP","first-page":"117","article-title":"Fourier's elimination: which to choose?","author":"Imbert","year":"1993"},{"key":"10.1016\/j.jsc.2025.102527_br0230","series-title":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","first-page":"353","article-title":"Quantifier elimination over the integers","author":"Jing","year":"2025"},{"key":"10.1016\/j.jsc.2025.102527_br0240","series-title":"Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation","first-page":"351","article-title":"Efficient detection of redundancies in systems of linear inequalities","author":"Jing","year":"2024"},{"key":"10.1016\/j.jsc.2025.102527_br0250","series-title":"Proceedings of CASC","first-page":"225","article-title":"Computing the integer points of a polyhedron, I: algorithm","author":"Jing","year":"2017"},{"key":"10.1016\/j.jsc.2025.102527_br0260","series-title":"Proceedings of CASC","first-page":"242","article-title":"Computing the integer points of a polyhedron, II: complexity estimates","author":"Jing","year":"2017"},{"key":"10.1016\/j.jsc.2025.102527_br0270","series-title":"Proceedings of CASC","first-page":"282","article-title":"Complexity estimates for Fourier-Motzkin elimination","author":"Jing","year":"2020"},{"key":"10.1016\/j.jsc.2025.102527_br0290","series-title":"Encyclopedia of Optimization","first-page":"1074","article-title":"Fourier-Motzkin elimination method","author":"Khachiyan","year":"2009"},{"key":"10.1016\/j.jsc.2025.102527_br0300","series-title":"Proceedings of the Fifth International Workshop on Compilers for Parallel Computers","first-page":"200","article-title":"On reducing overhead in loops","author":"Knijnenburg","year":"1995"},{"key":"10.1016\/j.jsc.2025.102527_br0310","series-title":"Projections of convex polyhedral sets","author":"Kohler","year":"1967"},{"key":"10.1016\/j.jsc.2025.102527_br0320","series-title":"International Symposium on Design and Implementation of Symbolic Computation Systems","first-page":"164","article-title":"Parametric queries, linear constraints and variable elimination","author":"Lassez","year":"1990"},{"issue":"3","key":"10.1016\/j.jsc.2025.102527_br0330","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00245296","article-title":"On Fourier's algorithm for linear arithmetic constraints","volume":"9","author":"Lassez","year":"1992","journal-title":"J. Autom. Reason."},{"key":"10.1016\/j.jsc.2025.102527_br0340","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.disopt.2018.06.002","article-title":"Convex hull results for the warehouse problem","volume":"30","author":"Laurence","year":"2018","journal-title":"Discrete Optim."},{"key":"10.1016\/j.jsc.2025.102527_br0350","series-title":"Loop nest synthesis using the polyhedral library","author":"Le Verge","year":"1994"},{"key":"10.1016\/j.jsc.2025.102527_br0360","author":"Loechner"},{"key":"10.1016\/j.jsc.2025.102527_br0380","series-title":"Static Analysis: 24th International Symposium, SAS 2017, New York, NY, USA, August 30\u2013September 1, 2017, Proceedings 24","first-page":"212","article-title":"Scalable minimizing-operators on polyhedra via parametric linear programming","author":"Mar\u00e9chal","year":"2017"},{"key":"10.1016\/j.jsc.2025.102527_br0390","series-title":"International Conference on Verification, Model Checking, and Abstract Interpretation","first-page":"367","article-title":"Efficient elimination of redundancies in polyhedra by raytracing","author":"Mar\u00e9chal","year":"2017"},{"key":"10.1016\/j.jsc.2025.102527_br0400","series-title":"Proceedings of TACAS","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"De Moura","year":"2008"},{"issue":"1","key":"10.1016\/j.jsc.2025.102527_br0370","first-page":"4:1","article-title":"Cache-oblivious algorithms","volume":"8","author":"Prokop","year":"2012","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jsc.2025.102527_br0410","series-title":"Proceedings Supercomputing '91","first-page":"4","article-title":"The Omega test: a fast and practical integer programming algorithm for dependence analysis","author":"Pugh","year":"1991"},{"issue":"5","key":"10.1016\/j.jsc.2025.102527_br0420","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1023\/A:1007554627716","article-title":"Generation of efficient nested loops from polyhedra","volume":"28","author":"Quiller\u00e9","year":"2000","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/j.jsc.2025.102527_br0430","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/j.jsc.2025.102527_br0440","series-title":"IEEE\/ACM International Conference on Computer Aided Design","first-page":"847","article-title":"Analog performance space exploration by Fourier-Motzkin elimination with application to hierarchical sizing","author":"Stehr","year":"2004"},{"key":"10.1016\/j.jsc.2025.102527_br0450","series-title":"Algorithms for matrix canonical forms","author":"Storjohann","year":"2000"},{"key":"10.1016\/j.jsc.2025.102527_br0460","author":"Verdoolaege"},{"key":"10.1016\/j.jsc.2025.102527_br0470","series-title":"Proceedings of ICMS","first-page":"299","article-title":"ISL: an integer set library for the polyhedral model","author":"Verdoolaege","year":"2010"},{"issue":"4","key":"10.1016\/j.jsc.2025.102527_br0480","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/2400682.2400713","article-title":"Polyhedral parallel code generation for CUDA","volume":"9","author":"Verdoolaege","year":"2013","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"10.1016\/j.jsc.2025.102527_br0500","series-title":"A Library for Doing Polyhedral Operations","author":"Wilde","year":"1993"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717125001099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717125001099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:24:48Z","timestamp":1773879888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717125001099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":50,"alternative-id":["S0747717125001099"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2025.102527","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient detection of redundancies in systems of linear inequalities","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2025.102527","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102527"}}