Title

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

Translated Titles

Combinatorial Heuristic Search for 0-1 Integer Linear Programming

Authors

高培旺(Pei-Wang Gao);范国兵(Guo-Bing Fan)

Key Words

0-1线性规划 ; 组合法 ; 直接搜寻法 ; 0-1 linear programming ; combinatorial method ; heuristic search

PublicationName

蘇州科技學院學報(自然科學版)

Volume or Term/Year and Month of Publication

21卷1期(2004 / 03 / 01)

Page #

22 - 26

Content Language

簡體中文

Chinese Abstract

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

English 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 lof the vectors in each set are carried out. Finally, a heuristic search for the optimality would be performed under the constraints.

Topic Category 基礎與應用科學 > 基礎與應用科學綜合
生物農學 > 生物農學綜合
工程學 > 工程學綜合