{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:47:17Z","timestamp":1773676037687,"version":"3.50.1"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[1972,9,1]],"date-time":"1972-09-01T00:00:00Z","timestamp":84153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[1972,9]]},"DOI":"10.1145\/361573.1015087","type":"journal-article","created":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T17:40:01Z","timestamp":1599586801000},"page":"818-820","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Algorithm 431: A computer routine for quadratic and linear programming problems [H]"],"prefix":"10.1145","volume":"15","author":[{"given":"Arunachalam","family":"Ravindran","sequence":"first","affiliation":[{"name":"Purdue Univ., Lafayette, IN"}]}],"member":"320","published-online":{"date-parts":[[1972,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","year":"1963","unstructured":"1 . Dantzig , G. B. Linear Programming and Extensions . Princeton U. Press . Princeton, N.J. 1963 . 1. Dantzig, G. B. Linear Programming and Extensions. Princeton U. Press. Princeton, N.J. 1963."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.11.7.681"},{"key":"e_1_2_1_3_1","first-page":"7","author":"Ravindran A.","year":"1970","unstructured":"3 . Ravindran , A. Computational aspects of Lemke's coniplementary algorithm applied to linear programs. Opsearch 7 ( 1970 ). 241-262. 3. Ravindran, A. Computational aspects of Lemke's coniplementary algorithm applied to linear programs. Opsearch 7 (1970). 241-262.","journal-title":"Opsearch"},{"key":"e_1_2_1_4_1","volume-title":"A comparison of the primal-simplex and complementary pivot methods for linear programming. Rep. No. 70-9 (July","author":"Ravindran A.","year":"1970","unstructured":"4 . Ravindran , A. A comparison of the primal-simplex and complementary pivot methods for linear programming. Rep. No. 70-9 (July 1970 ), School of Industrial Engineering, Purdue U. , Lafayette, Ind . 4. Ravindran, A. A comparison of the primal-simplex and complementary pivot methods for linear programming. Rep. No. 70-9 (July 1970), School of Industrial Engineering, Purdue U., Lafayette, Ind."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/361573.1015087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/361573.1015087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:17Z","timestamp":1750295417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/361573.1015087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,9]]},"references-count":4,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1972,9]]}},"alternative-id":["10.1145\/361573.1015087"],"URL":"https:\/\/doi.org\/10.1145\/361573.1015087","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,9]]},"assertion":[{"value":"1972-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}