摘要
文章介绍了背包问题和及其相关的理论,从扩大学生的受益面和提高实验室的利用效率出发,提出了一种基于背包问题的三值模型动态规划算法,通过三值模型的综合分值,结合相关排序算法和查找算法,协调了多方主体可能的冲突,有效的达到整体的近似最优化。
The paper describes the knapsack problem and its related theory. In order to achieve the greatest scope of students benefits and improving the efficiency of the use of the laboratory. It puts forward a dynamic programming algorithm of the three value models based on knapsack problem. Via the combined value of three model and the relevant sorting algorithm and search algorithm. The way achieves an effective approximation of the overall optimization and coordinates the various objects possible conflict.
出处
《计算机与数字工程》
2009年第4期17-19,27,共4页
Computer & Digital Engineering
基金
湖北省2006年省级教研项目<地方工科大学计算机课教学改革与创新>(编号:20060308)资助
关键词
背包
动态规划
预约系统
三值模型
受益面
knapsack algorithm, dynamic programming, reservation system, three value models, scope of benefits
