摘要
本文针对常规隐枚举法 ,提出了一种基于二进制转换的快速有效枚举出所有可能解的方法 ,包括旨在加速优化过程的所有可能解的排列规则 ,并给出了一个算例。
In point of the ordinary hide list method, this paper proposes a method that can list all possible solutions efficiently and quickly based on binary conversion, including the rule of arranging all solutions to hence optimizing process. Also an example is given.
出处
《运筹与管理》
CSCD
2000年第3期37-39,共3页
Operations Research and Management Science
关键词
隐枚举法
二进制转换
排列规则
hide list method
binary conversion
arranging rule
