摘要
针对南水北调项目群分期投资的效益问题,给出了数学模型,并利用背包问题的贪婪算法得到了项目群的最大效益及其工程开工顺序的安排情况,给项目投资计划处在选择项目投资阶段的人员以一定的参考,便于资金充分、合理地得到利用,最终得到最大的收益。
In this paper , a model about staged investment in South-to-North Water Transfer Project Group is builded, and the biggest benefit and arrangement about it are given by using the greedy algorithm of knapsack question. The results, to some extent, can help the financing planners to make arrangements more appropriate in financing, so as to get the biggest benefit.
出处
《科技进步与对策》
CSSCI
北大核心
2009年第21期50-52,共3页
Science & Technology Progress and Policy
基金
中科院研究生院院长基金(O85102QN00)
关键词
项目群
项目选择
贪婪算法
背包问题
Project Group
Project Selection
Greedy Algorithm
Knapsack Question
