维普期刊资源整合服务平台（V6.5）

86篇 您的检索式：作者名="Dial R"

选中清除导出查看参考文献查看引证文献引用追踪共5页首页上一页第1页下一页末页 /5 跳转

	题名	作者	年代	出处	被引量
1	A probabilistic multipath traffic assignment algorithm which obviates path enumeration显示文摘	Dial R B	1977	Transportation Research1977，7，5：	2
2	A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees显示文摘	Dial R B	1979	Network1979，25，3：	1
3	A probabilistic multipath traffic assignment model which obviates path enumeration 显示文摘	DIAL R B	1971	Transportation Research1971，5，2：	1
4	A Probabilistic Multipath Traffic Assign- ment Model Which Obviates Path Enumeration显示文摘	DIAL R B	1971	Transportation Research1971，5，2：	1
5	A restriced dynamic pro- gramming heuristic algorithm for the time dependent traveling salesman problem显示文摘	Malandraki C Dial R B	1996	European Journal of Operational Research1996，90，：	1
6	Transit pathfinder algorithm显示文摘	Dial R B		0，，：	1
7	A Probabilistic Multi-path Traffic Assignment Model Which Obviates the Need for PATH Enumeration 显示文摘	DIAL R B	1971	Transportation Research1971，5，2：	1
8	A Probabilistic Multi-path Traffic Assignment Model which Obviates the Need for Path Enumeration显示文摘	DIAL R B		0，，02：	1
9	An efficient algorithm for building rain-path trees for all origins in a multi-class network 显示文摘	DIAL R B	2006	Transportation Research Part 132006，40，10：	1
10	A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees显示文摘	Dial R Glover F Karney D	1999	Networks1999，9，9：	1
11	Algorithm 360:Shortest Path Forest with Topological Ordering显示文摘	Dial R B	1969	Communications ofthe ACM1969，12，：	1
12	Bicriterion traffic assignment: basic theory and elementary algorithms 显示文摘	Dial R B	1996	Transportation Science1996，，30：	1
13	A probabilistic multipath traffic assignment model which obviates path enumeration显示文摘	Dial R B	1971	Transportation Research1971，5，2：	1
14	A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem显示文摘	MALANDRAKI C DIAL R B	1996	European Journal of Operational Research1996，90，1：	1
15	A probabilistic multipath traffic assignment model which obviates path enumeration 显示文摘	Dial R B	1971	Transporta- tion Research Part B: Methodological1971，5，2：	1
16	A probabilistic multipath traffic assignment algorithm which obviates path enumeration显示文摘	DIAL R B	1971	Transportation Research1971，，5：	1
17	A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees 显示文摘	Dial R B Glover F Karney D	1979	Networks1979，9，9：	1
18	A matching based heuristic for scheduling mass transit crews and vehicles显示文摘	Bodin L Dial R	1983	Transportation Science1983，17，11：	1
19	Transit pathfinder algorithms显示文摘	Dial R B	1967	Highway Research Record1967，205，：	1
20	A probabilistic multi-path traffic assignment model which obviates path enumeration显示文摘	Dial R B	1971	Transportation Research1971，5，：	1

返回顶部每页显示：

共5页首页上一页第1页下一页末页 /5 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示