对求解0—1规划的两种隐枚举法的评价与改进  

TO ASSESS AND IMPROVE FOR TWO IMPLICIT ENUMERATIONMETHODS USES OF SOLVING 0-1 PROGRAMMING

作　　者：宛士春[1] 

机构地区：[1]青海大学

出　　处：《青海师范大学学报（自然科学版）》1995年第1期16-22,共7页Journal of Qinghai Normal University(Natural Science Edition)

摘　　要：本文详细探讨了目前用于求解０—１规划的两种隐枚举法的优点和缺陷，提出一种能兼容两种解法的优点并能弥补二者缺陷的新的解法，以实际算例论证了这种新解法的优越性，并以简明的程序在ＱＷ３８６／２５ｃ计算机上实施电算，取得理想结果。This paper disscuses the advantages and dihovantages of two Implicit Enumeration Methods in theuses of solving 0- 1 programming.It offers a new method that has advantages of two Implicit Enumeration Methods and makes up their drawbacks.Through the example,this essay illustractes it's advantages,and by the Basic progranon GW 386/25c,obtains the good results.

关 键 词：0-1规划 隐枚举法 过滤条件 整数规划 

分 类 号：O221.4[理学—运筹学与控制论]