Novel Trends in the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP...
保存先:
| フォーマット: | Online |
|---|---|
| 言語: | 英語 |
| 出版事項: |
IntechOpen
2021
|
| 主題: | |
| オンライン･アクセス: | ONIX_20210420_9781839624544_3141 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|