论文信息 - Two routing problems with the limitation of fuel

Two routing problems with the limitation of fuel

Two routing problems are considered. Although these two are related to each other, one is polynomially solvable and, by contrast, the other is NP-complete. First an efficient solution procedure is developed for the polynomially solvable problem. Then we establish NP-completeness of the other problem.

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Hiroaki Ishii,et al. ROUTING A VEHICLE WITH THE LIMITATION OF FUEL , 1981 .