论文信息 - A heuristic approach to the AIAA Design Challenge problem - 字舞流文

A heuristic approach to the AIAA Design Challenge problem

Ting-Yi Sung | Denis Naddef | Her-Jiun Sheu

[1] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[2] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[3] S. Martello,et al. An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .