摘要
本文讨论了具有Back-time约束的k-TSP问题,给出了求解该问题的近似算法,以及在最坏情况下由该算法产生的近似解的估计.
This paper deals with k-TSP problems with backtime constraints, and presents heuristic methods, together with worst-case estimates, for their approximate solutions.
出处
《长沙铁道学院学报》
CSCD
1993年第3期100-105,共6页
Journal of Changsha Railway University