|
|||||
|
|
| 对一类特殊多维0-1背包问题的可行域替代解法--生成单约束法 | |
| 引用本文： | 迟东璇,栾孟杰,赵强. 对一类特殊多维0-1背包问题的可行域替代解法--生成单约束法[J]. 渤海大学学报(自然科学版), 2005, 26(4): 327-330 |
| 作者姓名： | 迟东璇 栾孟杰 赵强 |
| 作者单位： | 渤海大学,数学系,辽宁,锦州,121013;渤海大学,数学系,辽宁,锦州,121013;渤海大学,数学系,辽宁,锦州,121013 |
| 基金项目： | 辽宁省教育厅科研项目资助（2004C59）. |
| 摘 要： | 针对一类组合优化问题一多维0-1背包问题（MKP），属于NP-难问题，提出一种能减少求解难度的方法——可行域替代解法。给出了MKP的替代约束的概念，提出了一种具体替代多约束组的计算方法。最后，通过具体的实例，阐述了算法的使用方法。 |
| 关 键 词： | 整数规划 可行域替代法 np-hrd问题 |
| 文章编号： | 1673-0569(2005)04-0327-04 |
| 收稿时间： | 2005-06-07 |
| 修稿时间： | 2005-06-07 |
Replacment method for restrict of special multi-dimension 0-1 Knapsack problem-creative method of single restrict |
|
| CHI Dong-xuan,LUAN Meng-jie,ZHAO Qiang. Replacment method for restrict of special multi-dimension 0-1 Knapsack problem-creative method of single restrict[J]. Journal of Bohai University:Natural Science Editio, 2005, 26(4): 327-330 | |
| Authors: | CHI Dong-xuan LUAN Meng-jie ZHAO Qiang |
| Affiliation: | Math. Dept. , Bohai University, Jinzhou 121013, China |
| Abstract: | In this paper, we raise a method of reducing the solving difficulty-the creative method of non-equivalence single restrict, aiming at a kind of combination and optimized problem -multi-dimension 0-1 knapsack problem (also called the NP -hard problem). We define the replacement restrictive conception of this problem, and lodged a calculation method of a replacing restrict group with a single restrict condition. Finaly, We explained the usage for this algorithm with practical example. |
| Keywords: | integer programming replacement method for restrict NP-hard problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |