{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:57Z","timestamp":1725664497268},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:31:42Z","timestamp":1330277502000},"page":"212-223","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of the gravitational method for linear programming"],"prefix":"10.1007","author":[{"given":"T. L.","family":"Morin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Prabhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(89)90002-4","volume":"25","author":"S. Y. Chang","year":"1989","unstructured":"Chang S Y and Murty K G, The Steepest Descent Gravitational Method for LP, Discrete Applied Mathematics, Vol. 25, 211\u2013240, 1989.","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR2","volume-title":"Linear Programming and Extensions","author":"G. B. Dantzig","year":"1963","unstructured":"Dantzig G B, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963."},{"key":"19_CR3","first-page":"367","volume":"4","author":"D Goldfarb","year":"1973","unstructured":"Goldfarb D and Sit W, Worst Case Behavior of the Steepest Edge Simplex Method, Discrete Applied Mathematics 4, 367\u2013377, 1973.","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/moor.12.4.718","volume":"12","author":"V Klee","year":"1987","unstructured":"Klee V and Kleinschmidt P, The d-step Conjecture and its Relatives, Mathematics of Operations Research 12, 718\u2013755, 1987.","journal-title":"Mathematics of Operations Research"},{"key":"19_CR5","first-page":"159","volume-title":"Inequalities III","author":"V Klee","year":"1972","unstructured":"Klee V and Minty G J, How Good is the Simplex Algorithm?, in: Inequalities III (O. Shisha, ed), Academic Press, New York, 159\u2013175, 1972."},{"issue":"No.4","key":"19_CR6","first-page":"206","volume":"23","author":"K. G. Murty","year":"1986","unstructured":"Murty K G, The Gravitational Method for LP, OPSEARCH, Vol. 23, No. 4, 206\u2013214, 1986.","journal-title":"OPSEARCH"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:37:36Z","timestamp":1619559456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}