{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:11Z","timestamp":1725663551299},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540531623"},{"type":"electronic","value":"9783540467380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53162-9_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:01:22Z","timestamp":1330207282000},"page":"117-131","source":"Crossref","is-referenced-by-count":9,"title":["Fourier algorithm revisited"],"prefix":"10.1007","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","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"8_CR1","unstructured":"S. Achmanov, Programmation Lin\u00e9aire, Editions Mir, Moscon 1984."},{"key":"8_CR2","unstructured":"H. Beringer, private communication."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"G.B. Dantzig","year":"1973","unstructured":"G.B. Dantzig and B.C. Eaves, Fourier-Motzkin Elimination and its Dual, Journal of Combinatorial Theory Ser. A, 14 (1973) 288\u2013297.","journal-title":"Journal of Combinatorial Theory Ser. A"},{"key":"8_CR4","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, Mathematical Programming, 12 (1977) 81\u201396.","journal-title":"Mathematical Programming"},{"key":"8_CR5","first-page":"xlvii","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) xlvii\u2013lv. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on His Work on Linear Inequalities, Opsearch 10 (1973) 38\u201342.)","journal-title":"Histoire de l'Acad\u00e9mie Royale des Sciences de l'Institut de France"},{"key":"8_CR6","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, Journal of Optimization Theory and Applications, 45 (1985) 577\u2013589.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"8_CR7","unstructured":"T. Huynh, L. Joskowicz and C. Lassez, Reasoning about Linear Constraints, (forthcoming)."},{"key":"8_CR8","unstructured":"T. Huynh and J-L. Lassez, Practical Issues on the Projection of Polyhedral Sets, IBM Research Report, T.J. Watson Research Center, 1990."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"H-J. Kruse, Degeneracy Graphs and the Neighborhood Problem, Springer Verlag Lecture Notes in Economics and Mathematical Systems No 260, 1986.","DOI":"10.1007\/978-3-642-49270-9"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, Parametric Queries, Linear Constraints and Variable Elimination, Proceedings of DISCO 90, Springer Verlag Lecture Notes in Computer Science, 1990.","DOI":"10.1007\/3-540-52531-9_136"},{"key":"8_CR11","unstructured":"J.L. Lassez and M.J. Maher, On Fourier's Algorithm for Linear Arithmetic Constraints, IBM Research Report, T.J. Watson Research Center, 1988."},{"key":"8_CR12","unstructured":"J-L. Lassez and K. McAloon, Applications of a Canonical Form for Generalized Linear Constraints, Proceedings of the FGCS Conference, Tokyo, December 1988, 703\u2013710."},{"key":"8_CR13","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, Mathematics of Operations Research, 5 (1980) 167\u2013185.","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53162-9_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:42Z","timestamp":1605648402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53162-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540531623","9783540467380"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-53162-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}