본문

  1. Home
  4. Search
4 Results:SS:TRAVELINGSALESMANPROBLEM 0.140 sec.
RSS 
Multilingual
 高级搜索
 新货搜索
选定的打印 선택엑셀내보내기
1
The Traveling Salesman Problem- [electronic resource] : a Computational Study
The Traveling Salesman Problem- [electronic resource] : a Computational Study
Applegate, David L. | Princeton University Press | 2011
打印
2
Search-Based Multi-Agent Multi-Target Multi-Objective Path Planning.
Search-Based Multi-Agent Multi-Target Multi-Objective Path Planning.
Ren, Zhongqiang.Mechanical Engineering. | Carnegie Mellon University. | 2022
打印
3
Fpt Aglorithms for NP-Complete Graph Problems Parameterized by Treewidth and Tree-Depth.
Fpt Aglorithms for NP-Complete Graph Problems Parameterized by Treewidth and Tree-Depth.
Belbasi, Mahdi. | The Pennsylvania State University. | 2022
打印
4
In pursuit of the traveling salesman- [electronic resource] : mathematics at the limits of computation
In pursuit of the traveling salesman- [electronic resource] : mathematics at the limits of computation
Cook, William | Princeton University Press | 2012
打印
처음1마지막