{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:44Z","timestamp":1725663164042},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540116073"},{"type":"electronic","value":"9783540394334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/3-540-11607-9_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:47:45Z","timestamp":1330192065000},"page":"135-143","source":"Crossref","is-referenced-by-count":0,"title":["Hacijan's algorithm in VAXIMA: improvements and difficulties"],"prefix":"10.1007","author":[{"given":"Paul S.","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"N. Anderson and P. Wang, \"MACSYMA experiments with a modified Khachiyan-type algorithm in linear programming\", ACM SIGSAM Bulletin, February 1980, pp. 8\u201313.","DOI":"10.1145\/1089212.1089214"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(80)90002-4","volume":"1","author":"B. Aspvall","year":"1980","unstructured":"B. Aspvall and R. E. Stone, \"Khachiyan's Linear Programming Algorithm\", Journal of Algorithms, Vol. 1, 1980, pp. 1\u201313.","journal-title":"Journal of Algorithms"},{"key":"16_CR3","unstructured":"G. B. Dantzig, \"Khachiyan's Algorithm: a comment by George Dantzig\", SIAM NEWS, Vol. 13, No. 5, October 1980."},{"key":"16_CR4","unstructured":"G. B. Dantzig, \"Expected Number of Steps of the Simplex Method for a Linear Program with a Convexity Constraint\", Technical Report SOL 80-3, Systems Optimization Laboratory, Department of Operations Research, Stanford University, March 1980."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"R. J. Fateman, \"The Macsyma \u2018Big-Floating-Point\" Arithmetic System\", Proceedings, ACM SYMSAC '76 Conference, Yorktown Heights, N.Y., August 10\u201312, 1976, pp. 209\u2013213.","DOI":"10.1145\/800205.806336"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"J. K. Foderaro and R. J. Fateman, \"Characterization of VAX Macsyma\", Proceedings, ACM SYMSAC '81 Conference, Snowbird, Utah, August 5\u20137, 1981, pp. 14\u201319.","DOI":"10.1145\/800206.806364"},{"key":"16_CR7","unstructured":"P. Gill, W. Murray, M. Saunders and M. Wright, \"A Numerical Investigation of Ellipsoid Algorithms for Large-Scale Linear Programming\", Technical Report, SOL 80-27, Department of Operations Research, Stanford University, 1980."},{"key":"16_CR8","unstructured":"L. G. Hacijan, \"A Polynomial Algorithm in Linear Programming\", Soviet Math. Dokl. Vol. 20(1979), No. 1."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BFb0017304","volume":"104","author":"J. Hopcraft","year":"1981","unstructured":"J. Hopcraft, \"Recent Directions in Algorithmic Research\", Springer Lecture Notes in Computer Science, Vol. 104, 1981, pp. 123\u2013134.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp, \"Complexity of Computer Computations\", (Proceedings, Sympos., IBM Thomas J. Watson Research Ctr., Yorktown Heights, N.Y., 1972) Plenum Press, New York, 1972, p. 85."},{"key":"16_CR11","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"V. Klee and G. J. Minty, \"How Good is the Simplex Algorithm?\". Inequalities III, ed. O. Shisha, Academic Press, N.Y., 1972."},{"key":"16_CR12","unstructured":"P. Wolfe, \"A Bibliography for the Ellipsoid Algorithm\", IBM Research Center Report No. 8237 (Apr. 1980)."},{"key":"16_CR13","volume-title":"MACSYMA Reference Manual","author":"Math Lab Group","year":"1977","unstructured":"Math Lab Group, MACSYMA Reference Manual, version 9, LCS, MIT, Cambridge, Mass. 1977.","edition":"version 9"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-11607-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:13Z","timestamp":1605643513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-11607-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540116073","9783540394334"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-11607-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]}}}