巡回セールスマン問題の近似アルゴリズムについて

機関リポジトリ 機関リポジトリ (HANDLE)

この論文をさがす

説明

The Traveling Salesman Problem (TSP) is the task of finding a route through a given set of cities with shortest possible length. Many practical applications (VLSI design, etc.) can be modeled as a TSP. But, TSP is NP-hard, so the efficient approximation algorithms have been studied so far. In this paper, we show new approximation algorithms for TSP and the experimental results for these algorithms.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ