当前位置:首页 » 翻译 
  • 匿名
关注:1 2013-05-23 12:21

求翻译:旅行商问题是典型的NP - hard组合优化问题,本文主要介绍了旅行售货员问题的两个基本算法是什么意思?

待解决 悬赏分:1 - 离问题结束还有
旅行商问题是典型的NP - hard组合优化问题,本文主要介绍了旅行售货员问题的两个基本算法
问题补充:

  • 匿名
2013-05-23 12:21:38
Traveling salesman problem is a typical NP - hard combinatorial optimization problems , the paper describes two basic algorithm traveling salesman problem
  • 匿名
2013-05-23 12:23:18
Travel providers is a typical NP - hard portfolio optimization problems, this paper focuses on the travel assistants of two basic algorithms
  • 匿名
2013-05-23 12:24:58
The travel peddler the question is typical NP - the hard combination optimization question, this article mainly introduced the travel sales clerk question two basic algorithms
  • 匿名
2013-05-23 12:26:38
Traveling salesman problem is a typical NP-hard combinatorial optimization problem, this paper mainly introduces two basic algorithm for traveling salesman problem
  • 匿名
2013-05-23 12:28:18
正在翻译,请等待...
 
 
网站首页

湖北省互联网违法和不良信息举报平台 | 网上有害信息举报专区 | 电信诈骗举报专区 | 涉历史虚无主义有害信息举报专区 | 涉企侵权举报专区

 
关 闭