• Bài trích
  • Nhan đề: Finding the k reliable shortest paths under travel time uncertainty /Bi Yu Chen a , ∗ , Qingquan Li b , a , William H.K. Lam

Tác giả CN Chen,Bi Yu
Nhan đề Finding the k reliable shortest paths under travel time uncertainty /Bi Yu Chen a , ∗ , Qingquan Li b , a , William H.K. Lam
Từ khóa tự do Reliability
Từ khóa tự do K reliable shortest paths problem
Từ khóa tự do Travel time uncertainty
Nguồn trích Transportation research part B: Methodological2016-12 Số: 1 Tập: 94
00000000nab#a2200000ui#4500
00113677
0026
00411837F9C-5067-41F3-9F4F-1592BB3DF38F
005201706161340
008081223s vm| vie
0091 0
039|y20170616134709|zcuonglv
100 |aChen,Bi Yu
245 |aFinding the k reliable shortest paths under travel time uncertainty /Bi Yu Chen a , ∗ , Qingquan Li b , a , William H.K. Lam
653 |aReliability
653 |aK reliable shortest paths problem
653 |aTravel time uncertainty
773 |tTransportation research part B: Methodological|v94|i1|d2016-12
890|c1|a0|b0|d3
Không tìm thấy biểu ghi nào