| 0-1背包问题的非线性降维近似算法 |
| |
| 引用本文： | 赵建英.0-1背包问题的非线性降维近似算法[J].内蒙古师范大学学报(自然科学版),2007,36(1):25-29. |
| |
| 作者姓名： | 赵建英 |
| |
| 作者单位： | 内蒙古商贸职业学院基础部 内蒙古呼和浩特010010 |
| |
| 摘 要： | 求解0-1背包问题的精确算法不能在较短时间内求解大规模0-1背包问题,使其实用性受到限制.针对该问题,给出求解0-1背包问题的非线性降维算法,并进行了数值实验,验证了算法的有效性.该算法属于近似算法,相对其他一些近似算法,计算结果更为精确.
|
| 关 键 词： | 0-1背包问题 非线性降维算法 精确算法 近似算法 |
| 文章编号： | 1001-8735（2007）01-0025-05 |
| 收稿时间： | 2006-06-10 |
| 修稿时间： | 2006年6月10日 |
Nonlinear Reductive Dimension Approximate Algorithm for 0-1 Knapsack Problem |
| |
| ZHAO Jian-ying.Nonlinear Reductive Dimension Approximate Algorithm for 0-1 Knapsack Problem[J].Journal of Inner Mongolia Normal University(Natural Science Edition),2007,36(1):25-29. |
| |
| Authors: | ZHAO Jian-ying |
| |
| Affiliation: | Basic Department of Inner Mongolia Commercial and Trade Special College, Hohhot 010010 ,China |
| |
| Abstract: | The precise and approximate algorithms solving 0-1 knapsack problem,precise algorithm could not be used to solve 0-1 knapsack problem in a short time,so it could not be applied extensively.For the reason,nonlinear reductive dimension algorithm for 0-1 knapsack problem was given here,and effectiveness of the algorithm was confirmed by numerical experiments.Compared with other some approximate(algorithms),this approximate one is more precise. |
| |
| Keywords: | 0-1 knapsack problem nonlinear reductive dimension algorithm precise algorithm (approximate) algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
