Fan, Wentao; Ding, Yiming The Jeep-fuel station problems. (Chinese. English summary) Zbl 0973.90009 Acta Math. Sci. (Chin. Ed.) 20, No. 1, 85-94 (2000). Summary: The Jeep-fuel station problems are studied by the optimal sequence method. The optimal sequences of the one-way trip Jeep-fuel station problem and the round trip Jeep-fuel station problem are determined. Cited in 1 Document MSC: 90B06 Transportation, logistics and supply chain management 90C90 Applications of mathematical programming 90C31 Sensitivity, stability, parametric optimization Keywords:Jeep’s problem; Jeep-fuel station problem; optimal sequence; dynamic program using PDFBibTeX XMLCite \textit{W. Fan} and \textit{Y. Ding}, Acta Math. Sci. (Chin. Ed.) 20, No. 1, 85--94 (2000; Zbl 0973.90009)