| 关于销售集团投资设置销售分店问题的IP模型 |
| |
| 引用本文： | 左黎明,汤鹏志,廖宇波,胡梅.关于销售集团投资设置销售分店问题的IP模型[J].数学的实践与认识,2005,35(2):21-25. |
| |
| 作者姓名： | 左黎明 汤鹏志 廖宇波 胡梅 |
| |
| 作者单位： | 1. 华东交通大学基础科学学院,江西,南昌,330013;江西师范大学数学与信息学院,江西,南昌,330027
2. 华东交通大学基础科学学院,江西,南昌,330013 |
| |
| 摘 要： | 针对一个实际投资实例建立了一个基于 0 -1背包问题的数学模型 ,并利用多个算法加以求解 ,并对结果进行了比较 .该模型具有很高的应用价值和参考价值 .
|
| 关 键 词： | 背包问题 算法 IP模型 NP问题 |
| 修稿时间： | 2003年2月20日 |
An IP Model of the Best Proportion of Investment on Branch Departments |
| |
| ZUO Li-ming,TANG Peng-zhi,LIAO Yu-bo,HU Mei.An IP Model of the Best Proportion of Investment on Branch Departments[J].Mathematics in Practice and Theory,2005,35(2):21-25. |
| |
| Authors: | ZUO Li-ming TANG Peng-zhi LIAO Yu-bo HU Mei |
| |
| Institution: | ZUO Li-ming 1,2,TANG Peng-zhi1,LIAO Yu-bo1,HU Mei1 |
| |
| Abstract: | Stimulated by a practical example of investment, this paper sets up a mathematic model based on Zero-One Knapsack Problem. Adopting the theory of several kinds algorithms, it provides five alternative solutions as well as a detailed comparison between the solutions. To some extent, this model is full of practical value and theoretical value. |
| |
| Keywords: | knapsack problem algorithm IP model NP problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
