travelling salesman problem

名词 n.

英文释义

名词 n.
  1. The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city. Canada,UK

词形变化

0 次浏览 数据来源: Wiktionary