A Quick Algorithm for Calculating the Lower Bound of Symmetric Traveling Salesman Problem

Ai Bing NING;Liang MA

Systems Engineering - Theory & Practice ›› 2004, Vol. 24 ›› Issue (12) : 84-88.

PDF(183 KB)
中国科学院数学与系统科学研究院期刊网
PDF(183 KB)
Systems Engineering - Theory & Practice ›› 2004, Vol. 24 ›› Issue (12) : 84-88. DOI: 10.12011/1000-6788(2004)12-84
论文

A Quick Algorithm for Calculating the Lower Bound of Symmetric Traveling Salesman Problem

    {{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

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Systems Engineering - Theory & Practice, 2004, 24(12): 84-88 https://doi.org/10.12011/1000-6788(2004)12-84

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(183 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉