[1]  Always G C.  Crossing the desert.  Math Gazette, 1957, 41: 209

[2]  Bellman R E.  Dynamic Programming. Princeton University Press, 1957

[3] Ding Yiming, Fan Wentao. The optimal sequence of jeep problem. Systems Engineering-Theory and Practice, 2000, (2): 97--103

[4]  Ding Yiming,   Fan Wentao.  The jeep-fuel station problems. Acta Mathematica Scientia, 2000, 20(1): 85--94

[5]  Fine N J.  The jeep problem.  Amer Math Monthly, 1947, 54: 24--31

[6]  Gale D.  The jeep once more or jeep by the dozen. Amer Math Monthly, 1970, 77: 493--501

[7]  Hausrath A,  Jachson B,  Mitchem J, Schmeichel E. Gale's round-trip jeep problem. Amer Math Monthly, 1995, 105: 299--309

[8]  Phipps C G. The jeep problem, a more general solution. Amer Math Monthly, 1947, 54: 458--462

[9]  Li Xiaoya,  Cui Jinchuan. Efficient algorithm for kind of exploration problem with N vehicles. Journal of Systems Engineering, 2008, 23(4): 444--448

[10]  Przemyslaw Klesk. The jeep problem, searching for the best strategy with a genetic algorithm. Information Processing and Security Systems, 2005: 453--464