| Title: |
An effective method to find the k shortest paths in a generalized time-window network |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Xiao-Bing Hu |
-
Beijing Normal University, Academy of Disaster Reduction and Emergence Management
|
| Ming-Kong Zhang |
-
Beijing Normal University, Academy of Disaster Reduction and Emergence Management
|
| Jian-Qin Liao |
-
Chengdu MiidShare Technology Ltd
|
| Hailin Zhang |
-
Ministry of Transport, Research Institute of Highway
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/cec/HuZLZ16
|
| Author Comments: |
|