Exact and Approximate Stability of Solutions to Traveling Salesman Problems.

IEEE Transactions on Cybernetics(2018)

引用 11|浏览10
暂无评分
摘要
This paper presents the stability analysis of an optimal tour for the symmetric traveling salesman problem (TSP) by obtaining stability regions. The stability region of an optimal tour is the set of all cost changes for which that solution remains optimal and can be understood as the margin of optimality for a solution with respect to perturbations in the problem data. It is known that it is not p...
更多
查看译文
关键词
Numerical stability,Stability criteria,Robustness,Vehicles,Traveling salesman problems,Routing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要