Traveling salesman problem ( TSP ) a typical NP complete combinatorial optimum problem.

旅行商问题 ( TSP ) 是典型的NP完全组合优化问题.

互联网

Traveling salesman problem ( TSP ) is a typical NP complete combinatorial optimum problem.

摘要旅行商问题 ( TSP ) 是典型的NP完全组合优化问题.

互联网

The travelling salesman problem was used to illustrate NP - hard problems.

旅行商问题的是用来说明NP难问题.

互联网

This article proposes a modified algorithm for solving the travelling salesman problem ( TSP ) by neural network.

本文提出用神经网络解旅行商问题 ( TSP ) 的改进算法.

互联网

Traveling Salesman Problem, or TSP problem ( Travelling Salesman Problem ) is a well - known field of mathematics problems.

旅行商问题, 即TSP问题 ( TravellingSalesmanProblem ) 是数学领域中著名问题之一.

互联网

A new improved discrete particle swarm optimization algorithm is designed to tackle the Traveling Salesman Problem.

借鉴蚁群算法的信息素机制,提出了一种基于信息素机制的离散粒子群算法.

互联网