乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T05:17:43Z","timestamp":1672723063010},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2001,9]]},"abstract":"We describe a modification of the simplex formulas in which Q-matrices are used to implement exact computations with an integer multiprecision library. Our motivation comes from the need for efficient and exact incremental solvers in the implementation of constraint solving languages such as Prolog. We explain how to reformulate the problem and the different steps of the simplex algorithm. We compare some measurements obtained with integer and rational computations.<\/jats:p>","DOI":"10.1145\/502800.502804","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:31:44Z","timestamp":1027769504000},"page":"350-360","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A revised simplex method with integer Q-matrices"],"prefix":"10.1145","volume":"27","author":[{"given":"David-Olivier","family":"Azulay","sequence":"first","affiliation":[{"name":"Universit\u00e9 de la M\u00e9diterran\u00e9e, Marseille, France"}]},{"given":"Jean-Fran\u00e7ois","family":"Pique","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de la M\u00e9diterran\u00e9e, Marseille, France"}]}],"member":"320","published-online":{"date-parts":[[2001,9]]},"reference":[{"key":"e_1_2_1_2_1","article-title":"Expecting a better numerical precision for some linear constraints. ACM","author":"AZULAY D.-O.","year":"2001","unstructured":"AZULAY , D.-O. 2001 . Expecting a better numerical precision for some linear constraints. ACM Trans. Math. Softw., submitted.]] AZULAY, D.-O. 2001. Expecting a better numerical precision for some linear constraints. ACM Trans. Math. Softw., submitted.]]","journal-title":"Trans. Math. Softw., submitted.]]"},{"key":"e_1_2_1_3_1","first-page":"55","volume-title":"Principles and Practice of Constraint Programming (Pisa, Italy, Oct.), M. Maher and J.-F","author":"AZULAY D.-O.","unstructured":"AZULAY , D.-O. AND PIQUE , J.-F. 1998. Optimized Q-pivot for exact linear solvers . In Principles and Practice of Constraint Programming (Pisa, Italy, Oct.), M. Maher and J.-F . Puget, Eds., Springer- Verlage New York , pp. 55 - 71 .]] AZULAY, D.-O. AND PIQUE, J.-F. 1998. Optimized Q-pivot for exact linear solvers. In Principles and Practice of Constraint Programming (Pisa, Italy, Oct.), M. Maher and J.-F. Puget, Eds., Springer- Verlage New York, pp. 55-71.]]"},{"key":"e_1_2_1_4_1","first-page":"565","article-title":"Sylvester's identity and multistep integer-preserving Gaussian elimination","volume":"22","author":"BAREISS E. H.","year":"1968","unstructured":"BAREISS , E. H. 1968 . Sylvester's identity and multistep integer-preserving Gaussian elimination . Math. Comput. 22 , 565 - 578 .]] BAREISS, E. H. 1968. Sylvester's identity and multistep integer-preserving Gaussian elimination. Math. Comput. 22, 565-578.]]","journal-title":"Math. Comput."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1093\/imamat\/10.1.68","article-title":"Computational solutions of matrix problems over an integral domain","volume":"10","author":"BAREISS E. H.","year":"1972","unstructured":"BAREISS , E. H. 1972 . Computational solutions of matrix problems over an integral domain . J. Inst. Maths Applics 10 , 68 - 104 .]] BAREISS, E. H. 1972. Computational solutions of matrix problems over an integral domain. J. Inst. Maths Applics 10, 68-104.]]","journal-title":"J. Inst. Maths Applics"},{"key":"e_1_2_1_6_1","unstructured":"BENHAMOU F. BOUVIER F. COLMERAUER A. GARRETA H. GILLETA B. MASSAT J. AND NARBONI G. 1996. Manual of Prolog IV. Prologia.]] BENHAMOU F. BOUVIER F. COLMERAUER A. GARRETA H. GILLETA B. MASSAT J. AND NARBONI G. 1996. Manual of Prolog IV. Prologia.]]"},{"issue":"3","key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/ijoc.4.3.267","article-title":"Implementing the simplex method: The initial basis","volume":"4","author":"BIXBY R. E.","year":"1992","unstructured":"BIXBY , R. E. 1992 . Implementing the simplex method: The initial basis . ORSA J. Comput. 4 , 3 , 267 - 284 .]] BIXBY, R. E. 1992. Implementing the simplex method: The initial basis. ORSA J. Comput. 4,3, 267-284.]]","journal-title":"ORSA J. Comput."},{"issue":"1","key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","article-title":"Progress in linear programming","volume":"6","author":"BIXBY R. E.","year":"1994","unstructured":"BIXBY , R. E. 1994 . Progress in linear programming . ORSA J. Comput. 6 , 1 , 15 - 22 .]] BIXBY, R. E. 1994. Progress in linear programming. ORSA J. Comput. 6, 1, 15-22.]]","journal-title":"ORSA J. Comput."},{"key":"e_1_2_1_9_1","volume-title":"Linear Programming W","author":"CHV~TAL V.","unstructured":"CHV~TAL , V. 1983. Linear Programming W . H. Freeman and Company .]] CHV~TAL, V. 1983. Linear Programming W. H. Freeman and Company.]]"},{"key":"e_1_2_1_10_1","unstructured":"EDMONDS J. 1994. Exact pivoting. For ECCO VII.]] EDMONDS J. 1994. Exact pivoting. For ECCO VII.]]"},{"issue":"2","key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1051\/ro\/1997310202031","article-title":"Notes sur les Q-matrices d'Edmonds","volume":"31","author":"EDMONDS J.","year":"1997","unstructured":"EDMONDS , J. AND MAURRAS , J.-F. 1997 . Notes sur les Q-matrices d'Edmonds . RAIRO 31 , 2 , 203 - 209 .]] EDMONDS,J.AND MAURRAS, J.-F. 1997. Notes sur les Q-matrices d'Edmonds. RAIRO 31, 2, 203-209.]]","journal-title":"RAIRO"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01593804","article-title":"A practicable steepest-edge simplex algorithm","volume":"12","author":"GOLDFARB D.","year":"1977","unstructured":"GOLDFARB , D. AND REID , J. 1977 . A practicable steepest-edge simplex algorithm . Math. Prog. 12 , 361 - 371 .]] GOLDFARB,D.AND REID, J. 1977. A practicable steepest-edge simplex algorithm. Math. Prog. 12, 361-371.]]","journal-title":"Math. Prog."},{"key":"e_1_2_1_13_1","volume-title":"The GNU Multiple Precision Arithmetic Library (2.0.2 ed.)","author":"GRANLUND T.","unstructured":"GRANLUND , T. 1996. The GNU Multiple Precision Arithmetic Library (2.0.2 ed.) . Free Software Foundation .]] GRANLUND, T. 1996. The GNU Multiple Precision Arithmetic Library (2.0.2 ed.). Free Software Foundation.]]"},{"key":"e_1_2_1_14_1","volume-title":"IEEE Standard for Binary Floating-Point Arithmetic","author":"IEEE","year":"1985","unstructured":"IEEE . 1985. IEEE Standard for Binary Floating-Point Arithmetic , NASI\/IEEE 754- 1985 . Institute of Electrical and Electronics Engineers .]] IEEE. 1985. IEEE Standard for Binary Floating-Point Arithmetic, NASI\/IEEE 754-1985. Institute of Electrical and Electronics Engineers.]]"},{"key":"e_1_2_1_15_1","first-page":"289","volume-title":"Real Numbers and Computers Conferences (Saint- ~tienne, France, Apr.). J.-C. Bajard, D. Michelucci, J.-M. Moreau, and J.-M. Muller, Eds.","author":"PIQUE J.-F.","year":"1995","unstructured":"PIQUE , J.-F. 1995 . Un algorithme efficace pour l'implantation de contraintes arithm~tiques en pr~cision infinie . In Real Numbers and Computers Conferences (Saint- ~tienne, France, Apr.). J.-C. Bajard, D. Michelucci, J.-M. Moreau, and J.-M. Muller, Eds. pp. 289 - 293 .]] PIQUE, J.-F. 1995. Un algorithme efficace pour l'implantation de contraintes arithm~tiques en pr~cision infinie. In Real Numbers and Computers Conferences (Saint- ~tienne, France, Apr.). J.-C. Bajard, D. Michelucci, J.-M. Moreau, and J.-M. Muller, Eds. pp. 289-293.]]"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/502800.502804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:23:19Z","timestamp":1672690999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/502800.502804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["10.1145\/502800.502804"],"URL":"https:\/\/doi.org\/10.1145\/502800.502804","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]},"assertion":[{"value":"2001-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}