CONTINUOUS-TIME SHORTEST-PATH PROBLEMS WITH STOPPING AND STARTING COSTS

被引：6
|
作者：
PHILPOTT, AB
MEES, AI
机构：
[1] UNIV AUCKLAND,DEPT ENGN SCI,AUCKLAND,NEW ZEALAND
[2] UNIV WESTERN AUSTRALIA,DEPT MATH,NEDLANDS,WA 6009,AUSTRALIA
来源：
APPLIED MATHEMATICS LETTERS | 1992年 / 5卷 / 05期
关键词：
D O I：
10.1016/0893-9659(92)90066-I
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We describe a general solution method for the problem of finding the shortest path between two vertices of a graph in which each edge has some transit time, costs can vary with time, and stopping and parking (with corresponding costs) are allowed at the vertices.
引用
收藏
页码：63 / 66
页数：4
相关论文
共 50 条
12345