| 基于二进制转换的0—1规划隐枚举法 |
| |
| 引用本文： | 江兵.基于二进制转换的0—1规划隐枚举法[J].运筹与管理,2000,9(3):37-39. |
| |
| 作者姓名： | 江兵 |
| |
| 作者单位： | 合肥工业大学管理学院，安徽合肥230009 |
| |
| 摘 要： | 本针对常规隐枚举法，提出了一种基于二进制转换的快速有效枚举出所有可能解的方法，包括旨在加速优化过程的所有可能解的排列规则，并给出了一个算例。
|
| 关 键 词： | 隐枚举法 二进制转换 排列规则 |
Hide List Method for 0-1 Programming Based on Binary Conversion |
| |
| Jiang Bing.Hide List Method for 0-1 Programming Based on Binary Conversion[J].Operations Research and Management Science,2000,9(3):37-39. |
| |
| Authors: | Jiang Bing |
| |
| Abstract: | 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. |
| |
| Keywords: | hide list method binary conversion arranging rule |
| 本文献已被 CNKI 维普 等数据库收录！ |
