| Article ID: | iaor20014150 |
| Country: | China |
| Volume: | 20A |
| Issue: | 1 |
| Start Page Number: | 85 |
| End Page Number: | 94 |
| Publication Date: | Feb 2000 |
| Journal: | Acta Mathematica Scientia |
| Authors: | Fan Wentao, Ding Yiming |
| Keywords: | programming: dynamic |
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.