文件名称:book2
- 所属分类:
- 单片机(51,AVR,MSP430等)
- 资源属性:
- [PDF]
- 上传时间:
- 2012-11-26
- 文件大小:
- 973kb
- 下载次数:
- 0次
- 提 供 者:
- mehdi ******
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
A large number of real-world planning problems called combinatorial
optimization problems share the following properties: They are optimiza-
tion problems, are easy to state, and have a nite but usually very large
number of feasible solutions. While some of these as e.g. the Shortest Path
problem and the Minimum Spanning Tree problem have polynomial algo-
ritms, the majority of the problems in addition share the property that no
polynomial method for their solution is known.
optimization problems share the following properties: They are optimiza-
tion problems, are easy to state, and have a nite but usually very large
number of feasible solutions. While some of these as e.g. the Shortest Path
problem and the Minimum Spanning Tree problem have polynomial algo-
ritms, the majority of the problems in addition share the property that no
polynomial method for their solution is known.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
182.pdf