| 0-1整数线性规划的一种组合直接搜寻法 |
| |
| 引用本文： | 高培旺,范国兵.0-1整数线性规划的一种组合直接搜寻法[J].苏州科技学院学报(自然科学版),2004,21(1):22-26,31. |
| |
| 作者姓名： | 高培旺 范国兵 |
| |
| 作者单位： | 中南大学铁道校区,数学科学与计算技术学院,湖南,长沙,410075 |
| |
| 摘 要： | 本文提出了一种求解0-1线性规划的组合搜寻技术，首先它把分量取0或1的所有整数向量按分量中所含1的个数进行分类；然后在每类点集中对取1的分量实施适当的组合；最后，根据约束条件搜寻最优解。
|
| 关 键 词： | 0-1线性规划 组合法 直接搜寻法 |
| 文章编号： | 1672-0687(2004)01-0022-05 |
Combinatorial Heuristic Search for 0-1 Integer Linear Programming |
| |
| GAO Pei-wang,FAN Guo-bing.Combinatorial Heuristic Search for 0-1 Integer Linear Programming[J].Journal of University of Science and Technology of Suzhou,2004,21(1):22-26,31. |
| |
| Authors: | GAO Pei-wang FAN Guo-bing |
| |
| Abstract: | This paper presents a combinatorial heuristic search for 0-1 linear programming problems. At first,all 0-1 integers vectors will be assorted to n 1 sets according to the numbers of containing component 1. Then a fit combinatory for the variables corresponding to component 1of the vectors in each set are carried out. Finally,a heuristic search for the optimality would be performed under the constraints. |
| |
| Keywords: | linear programming combinatorial method heuristic search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
