0-1整数线性规划的一种组合直接搜寻法

Combinatorial Heuristic Search for 0-1 Integer Linear Programming

本文提出了一种求解0-1线性规划的组合搜寻技术,首先它把分量取0或1的所有整数向量按分量中所含1的个数进行分类;然后在每类点集中对取1的分量实施适当的组合;最后,根据约束条件搜寻最优解。

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.