首页 | 本学科首页   官方微博 | 高级检索  
     检索      

对求解0—1规划的两种隐枚举法的评价与改进
引用本文:宛士春.对求解0—1规划的两种隐枚举法的评价与改进[J].青海师范大学学报(自然科学版),1995(1):16-22.
作者姓名:宛士春
作者单位:青海大学
摘    要:本文详细探讨了目前用于求解0-1规划的两种隐枚举法的优点和缺陷,提出一种能兼容两种解法的优点并能弥补二者缺陷的新的解法,以实际算例论证了这种新解法的优越性,并以简明的BASIC程序在GW386/25C计算机上实施电算,取得理想结果。

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

TO ASSESS AND IMPROVE FOR TWO IMPLICIT ENUMERATIONMETHODS USES OF SOLVING 0-1 PROGRAMMING
wan Shichun.TO ASSESS AND IMPROVE FOR TWO IMPLICIT ENUMERATIONMETHODS USES OF SOLVING 0-1 PROGRAMMING[J].Journal of Qinghai Normal University(Natural Science Edition),1995(1):16-22.
Authors:wan Shichun
Institution:Qinghai University
Abstract: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.
Keywords:programming  Implicit Enumeration Method  Filtering Constraint  Nonfeasible Sub-area    
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号