An Effective Method to Find the k Shortest Paths in a Generalized Time-Window Network

GUO Rong-mei, HU Xiao-bing

Acta Electronica Sinica ›› 2020, Vol. 48 ›› Issue (7) : 1387-1395.

PDF(1585 KB)
CIE Homepage  |  Join CIE  |  Login CIE  |  中文 
PDF(1585 KB)
Acta Electronica Sinica ›› 2020, Vol. 48 ›› Issue (7) : 1387-1395. DOI: 10.3969/j.issn.0372-2112.2020.07.019

An Effective Method to Find the k Shortest Paths in a Generalized Time-Window Network

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}[J]. {{journal.qiKanMingCheng_EN}}, 2020, 48(7): 1387-1395 https://doi.org/10.3969/j.issn.0372-2112.2020.07.019

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(1585 KB)

Accesses

Citation

Detail
Sections
Recommended
Copyright © Acta Electronica Sinica, All Rights Reserved.
Tel: 010-68600735　
E-mail：new@ejournal.org.cn
Powered by Beijing Magtech Co. Ltd,.
Copyright © Acta Electronica Sinica, All Rights Reserved.

/

〈 〉