Paper Info
Title
Reconsidering the Jeep Problem - Or How to Transport a Birthday Present to Salosauna
Abstract
The simple problem of how far a jeep can travel with a given amount of gasoline if intermediate gasoline dumps may be used is a nice example for problems which seem to have obvious recursive solution algorithms but which may become quite difficult if the problem specification is slightly changed. The classical version allows that arbitrarily small parts of the given amount of gasoline may be filled in the jeep's tank. Wood has restricted the problem to a discrete problem by requiring that the tank can be refilled only when it is empty and that it must be refilled completely, and that the gasoline is available only in cans of the size of the tank. In an earlier note we had shown, by using a new strategy, that the seemingly adequate algorithm given by Wood in analogy to the optimal solution to the classical version is not optimal. The new strategy however is also not optimal. In this note we discuss variants of the new strategy and try to get a better understanding of the influences of (small) changes in the problem specification to the solution algorithms.
Year
DOI
Venue
1994
10.1007/3-540-58131-6_35
Results and Trends in Theoretical Computer Science
Keywords
Field
DocType
jeep problem,birthday present
Mathematical economics,Jeep problem,Sociology,Analogy,Recursion
Conference
ISBN
Citations 
PageRank 
3-540-58131-6
0
0.34
References 
Authors
2
2
Name
Order
Citations
PageRank
Wilfried Brauer1969299.36
Ute Brauer284.13