The Jeep Problem: The Maximum Rate of Delivery
Maurice Pollack · Journal of the Society for Industrial and Applied Mathematics · 1965
Previous article Next article The Jeep Problem: The Maximum Rate of DeliveryMaurice PollackMaurice Pollackhttps://doi.org/10.1137/0113075PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] O. Helmer, A problem in logistics: The jeep problem, Report, RA-15015, The RAND Corporation, Santa Monica, California, 1946 Google Scholar[2] O. Helmer, A problem in logistics: The jeep problem, Part 2, Report, RA-15019, The RAND Corporation, 1947 Google Scholar[3] N. J. Fine, The jeep problem, Amer. Math. Monthly, 54 (1947), 24–31 0030.00402 CrossrefGoogle Scholar[4] C. G. Phipps, The Jeep Problem: A More General Solution, Amer. Math. Monthly, 54 (1947), 458–462 MR1526783 CrossrefGoogle Scholar[5] J. N. Franklin, The range of a fleet of aircraft, J. Soc. Indust. Appl. Math., 8 (1960), 541–548 10.1137/0108039 MR0115830 0097.14605 LinkISIGoogle Scholar[6] Richard Bellman, Dynamic programming, Princeton Univeristy Press, Princeton, N. J., 1957, 103–, problem 54 MR0090477 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Volume 13, Issue 4| 1965Journal of the Society for Industrial and Applied Mathematics History Submitted:12 February 1965Published online:13 July 2006 InformationCopyright © 1965 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0113075Article page range:pp. 1079-1086ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics