Travelling salesman paths on Demidenko matrices

Eranda Çela,Vladimir G. Deineko,Gerhard J. Woeginger

arxiv（2021）

引用 0|浏览4

暂无评分

摘要

In the path version of the Travelling Salesman Problem (Path-TSP), a salesman is looking for the shortest Hamiltonian path through a set of n cities. The salesman has to start his journey at a given city s, visit every city exactly once, and finally end his trip at another given city t.

查看译文

关键词

Combinatorial optimization,Computational complexity,Travelling salesman problem,Tractable special case,Demidenko matrix

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要