{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:01:52Z","timestamp":1772553712538,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01535523","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T12:23:39Z","timestamp":1113913419000},"page":"295-315","source":"Crossref","is-referenced-by-count":48,"title":["Practical issues on the projection of polyhedral sets"],"prefix":"10.1007","volume":"6","author":[{"given":"Tien","family":"Huynh","sequence":"first","affiliation":[]},{"given":"Catherine","family":"Lassez","sequence":"additional","affiliation":[]},{"given":"Jean-Louis","family":"Lassez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BFb0121242","volume":"1","author":"R.J. Duffin","year":"1974","unstructured":"R.J. Duffin, On Fourier's analysis of linear inequality systems, Math. Progr. Study 1 (1974) 71?95.","journal-title":"Math. Progr. Study"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01593771","volume":"12","author":"M.E. Dyer","year":"1977","unstructured":"M.E. Dyer and L.G. Proll, An algorithm for determining all extreme points of a convex polytope, Math. Progr. 12 (1977) 81?96.","journal-title":"Math. Progr."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner,Algorithms in Computational Geometry (Springer, 1987).","DOI":"10.1007\/978-3-642-61568-9"},{"key":"CR4","first-page":"47","volume":"7","author":"J.B.J. Fourier","year":"1827","unstructured":"J.B.J. Fourier, reported in: Analyse des travaux de l'Acad\u00e9mie Royale des Sciences, pendant l'ann\u00e9e 1824, Partie math\u00e9matique,Histoire de l'Acad\u00e9mie Royale des Sciences de l'Institut de France 7 (1827) pp. 47?55. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on his work on Linear Inequalities, Opsearch 10 (1973) 38?42.","journal-title":"Histoire de l'Acad\u00e9mie Royale des Sciences de l'Institut de France"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BF00939135","volume":"45","author":"T. Gal","year":"1985","unstructured":"T. Gal, On the structure of the set bases of a degenerate point, J. Optim. Theory Appl. 45 (1985) 577?589.","journal-title":"J. Optim. Theory Appl."},{"key":"CR6","unstructured":"I. Golan, Direct polyhedron projection algorithm, IBM Research Report, T.J. Watson Research Center, RC 16969 (1991)."},{"key":"CR7","unstructured":"T. Huynh and J.-L. Lassez, Extreme point enumeration applied to projection of polyhedral sets, in preparation."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"T. Huynh, L. Joskowicz, C. Lassez and J.-L. Lassez, Reasoning about linear constraints using parametric queries, in:Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Sciences vol. 472 (Springer, 1990).","DOI":"10.1007\/3-540-53487-3_31"},{"key":"CR9","unstructured":"J. Jaffar, M.J. Maher, P.J. Stuckey and R.H.C. Yap, Output in CLP(R), to appear,FGCS'92."},{"key":"CR10","unstructured":"J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap, The CLP(R) language and system, to appear,TOPLAS'92."},{"key":"CR11","unstructured":"Special issue on: Algorithms in Real Algebraic Geometry, J. Symbol. Comput. 5 (1988)."},{"key":"CR12","volume-title":"Operational Research Center Report, ORC 67-29","author":"D.A. Kohler","year":"1967","unstructured":"D.A. Kohler, Projections of convex polyhedral sets, Operational Research Center Report, ORC 67-29, University of California, Berkeley (1967)."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"H.-J. Kruse,Degeneracy Graphs and the Neighborhood Problem, Lecture Notes in Economics and Mathematical Systems No. 260 (Springer, 1986).","DOI":"10.1007\/978-3-642-49270-9"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"J.-L. Lassez, Querying constraints,Proc. ACM Conf. on Principles of Database Systems, Nashville (1990).","DOI":"10.1145\/298514.298581"},{"key":"CR15","unstructured":"J.-L. Lassez, T. Huynh and K. McAloon, Simplification and elimination of redundant arithmetic constraints,Logic Programming: Proc. North American Conf. (MIT Press, 1989)."},{"key":"CR16","unstructured":"C. Lassez and J.-L. Lassez, Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm, IBM Research Report, T.J. Watson Research Center, RC 16779 (1991), also in:Symbolic and Numerical Computation ? Towards Integration, eds. Kapur and Mundy (Academic Press)."},{"key":"CR17","unstructured":"J.-L. Lassez and M.J. Maher, On Fourier's algorithm for linear arithmetic constraints, IBM Research Report, T.J. Watson Research Center, RC 14114 (1988), to appear in J. Autom. Reasoning."},{"key":"CR18","unstructured":"J.-L. Lassez and K. McAloon, A canonical form for generalized linear constraints, IBM Research Report, T.J. Watson Research Center, RC 15004 (1989), to appear in J. Symbol. Comput."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T.H. Matheiss","year":"1980","unstructured":"T.H. Matheiss and D.S. Rubin, A survey and comparison of methods for finding all vertices of convex polyhedral sets, Math. Oper. Res. 5 (1980) 167?185.","journal-title":"Math. Oper. Res."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, 1988).","DOI":"10.1002\/9781118627372"},{"key":"CR21","unstructured":"R.H. Taylor and V.T. Rajan, The efficient computation of uncertainty spaces for sensor-based robot planning IBM Research Report, T.J. Watson Research Center, RC 13998 (1988)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01535523\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01535523.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01535523\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01535523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:17:08Z","timestamp":1586218628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01535523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01535523"],"URL":"https:\/\/doi.org\/10.1007\/bf01535523","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}