Abstract
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total transportation costs between vertices. The insight into the structure of optimal refueling policies leads to an elegant reduction of the problem of finding optimal refueling policies into the classical shortest path problem, which ends in simple and more efficient algorithms for finding optimal refueling policies. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lin, S. H. (2008). Finding optimal refueling policies in transportation networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 280–291). https://doi.org/10.1007/978-3-540-68880-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
