{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:57:13Z","timestamp":1773752233760,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0377-2217(01)00396-4","type":"journal-article","created":{"date-parts":[[2002,11,4]],"date-time":"2002-11-04T15:06:14Z","timestamp":1036422374000},"page":"560-564","source":"Crossref","is-referenced-by-count":12,"title":["Obtaining a good primal solution to the uncapacitated transportation problem"],"prefix":"10.1016","volume":"144","author":[{"given":"R.R.K","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saumya","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00396-4_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"issue":"1","key":"10.1016\/S0377-2217(01)00396-4_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/opre.37.1.159","article-title":"Dual algorithms for pure network problems","volume":"37","author":"Ali","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00396-4_BIB3","series-title":"Operation Research","first-page":"158","author":"Hira","year":"1994"},{"key":"10.1016\/S0377-2217(01)00396-4_BIB4","unstructured":"J.B. Orlin, Genuinely polynomial simplex and non-simplex algorithms for minimum cost problems, Technical Report 1615-84, Sloan School of Management, MIT, Cambridge, MA, 1984"},{"key":"10.1016\/S0377-2217(01)00396-4_BIB5","series-title":"Proceedings of the First ACMN-SIAM Symposium on Discrete Algorithms","first-page":"367","article-title":"Improved dual network simplex","author":"Plotkin","year":"1990"},{"issue":"3","key":"10.1016\/S0377-2217(01)00396-4_BIB6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0377-2217(99)00081-8","article-title":"A new dual based procedure for the transportation problem","volume":"122","author":"Sharma","year":"2000","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003964?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003964?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T15:20:33Z","timestamp":1556378433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701003964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0377221701003964"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00396-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}