How to Find the Shortest Route with the Decomposition Algorithm on the National Railway Network

Men Shaopei;Zhan Nanpi

Systems Engineering - Theory & Practice ›› 1996, Vol. 16 ›› Issue (5) : 1-2.

PDF(292 KB)
PDF(292 KB)
Systems Engineering - Theory & Practice ›› 1996, Vol. 16 ›› Issue (5) : 1-2. DOI: 10.12011/1000-6788(1996)5-1
论文

How to Find the Shortest Route with the Decomposition Algorithm on the National Railway Network

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

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Systems Engineering - Theory & Practice, 1996, 16(5): 1-2 https://doi.org/10.12011/1000-6788(1996)5-1

References

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

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

Accesses

Citation

Detail

Sections
Recommended

/