{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:28Z","timestamp":1759666708917},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1980,9]]},"DOI":"10.1007\/bf01919246","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T14:11:52Z","timestamp":1122300712000},"page":"191-200","source":"Crossref","is-referenced-by-count":10,"title":["A min max problem"],"prefix":"10.1007","volume":"24","author":[{"given":"S.","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. C.","family":"Puri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01919246_CR1","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/nav.3800180404","volume":"18","author":"R.S. Garfinkel","year":"1971","unstructured":"Garfinkel, R.S., andM.R. Rao: The bottleneck transportation problem. Nav. Res. Log. Quart.18, 1971, 465\u2013472.","journal-title":"Nav. Res. Log. Quart."},{"key":"BF01919246_CR2","unstructured":"Hadley, G.: Linear Programming. Reading 1962."},{"key":"BF01919246_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/nav.3800160307","volume":"16","author":"P.L. Hammer","year":"1969","unstructured":"Hammer, P.L.: Time minimization transportation problem. Nav. Res. Log. Quart.16, 1969, 345\u2013357.","journal-title":"Nav. Res. Log. Quart."},{"issue":"4","key":"BF01919246_CR4","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1287\/opre.22.4.802","volume":"22","author":"S. Kaplan","year":"1974","unstructured":"Kaplan, S.: Applications of programs with maximin objective functions to problems of optimal resource allocation. Operations Research22 (4) 1974, 802\u2013807.","journal-title":"Operations Research"},{"key":"BF01919246_CR5","unstructured":"Mangasarian, O.: Non-linear programming. New York 1969."},{"key":"BF01919246_CR6","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"K. G. Murty","year":"1968","unstructured":"Murty, K. G.: An algorithm for ranking all the assignements in order of increasing cost. Operations Research16, 1968, 682\u2013687.","journal-title":"Operations Research"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919246.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01919246\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:32:43Z","timestamp":1557448363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01919246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["BF01919246"],"URL":"https:\/\/doi.org\/10.1007\/bf01919246","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}