Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer.
確定! 回上一頁