|
|||||
|
|
| NP组合优化近似计算的难度 | |
| 引用本文： | 张立昂. NP组合优化近似计算的难度[J]. 数学理论与应用, 1999, 0(3) |
| 作者姓名： | 张立昂 |
| 作者单位： | 北京大学计算机科学技术系 |
| 基金项目： | 九五国家重点科技攻关项目，北京大学自然科学预研基金 |
| 摘 要： | 本文扼要介绍近二十年来在组合优化可近似性的研究方面所取得的进展，包括不可近似性的证明，对组合优化问题用逻辑描述的语法分类及其可近似性． |
| 关 键 词： | 组合优化 NP难的 可近似性 |
The Hardness of Approximate Computation in NP Combinatorial Optimization |
|
| Zhang Liao. The Hardness of Approximate Computation in NP Combinatorial Optimization[J]. Mathematical Theory and Applications, 1999, 0(3) | |
| Authors: | Zhang Liao |
| Abstract: | In this paper,we presented the progress of approximate computation in combinatorial optimization in the recent twenty years,and which included the provety of non-approximability,and classed the problems of combinatorial optimization in the program of logical discussion and their approximation. |
| Keywords: | Combinatorial Optimization NP-hardness Approximability |
| 本文献已被 CNKI 等数据库收录！ | |