uva 116（Unidirectional TSP）（DP）

最新推荐文章于 2021-05-23 09:28:40 发布

conquerheaven

最新推荐文章于 2021-05-23 09:28:40 发布

阅读量558

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/u011836218/article/details/17761407

版权

该博客介绍了如何解决一种特殊的旅行商问题（TSP），即在一个只允许从左到右移动的网格中寻找最小路径。问题描述了一个包含整数的矩阵，目标是找出从第一列到最后一列的最短路径，路径可以水平或对角线相邻移动，并且矩阵的首尾行被认为是相邻的。博客提供了输入和输出格式，并给出了样例输入和输出。

摘要由CSDN通过智能技术生成

Unidirectional TSP

Background

Problems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing wire length. The Traveling Salesperson Problem (TSP) -- finding whether all the cities in a salesperson's route can be visited exactly once with a specified limit on travel time -- is one of the canonical examples of an NP-complete problem; solutions appear to require an inordinate amount of time to generate, but are simple to check.

This problem deals with finding a minimal path through a grid of points while traveling only from left to right.