travelling salesman problem

短语

[计] 巡回售货员问题; 货郎担问题

别名

travelling-salesman problem traveling salesman problem

释义与例句

n.
  1. 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.

    加拿大 英国 数学