带偏好的贪心算法应用  

Application of Greedy Algorithm with Preference

作　　者：吴平 方欢 WU Ping;FANG Huan(College of Mathematics and Big Data,Anhui University of Science and Technology,Huainan 23200,China)

机构地区：[1]安徽理工大学数学与大数据学院

出　　处：《电脑知识与技术》2020年第3期96-97,共2页Computer Knowledge and Technology

基　　金：大学生创新创业项目：个人健康跟踪和预警系统(S201910361204)

摘　　要：文章针对传统背包算法研究背包中物体权益值总和最大,存在无法根据用户偏好选择物品的缺陷,提出一种引入偏好值的方法,实现带偏好的贪心算法应用。该方法扩大了背包问题的适用范围。实验结果表明所提出的方法具有较好的适用性。In this paper,aiming at the problem that the total value of the object's equity in the traditional knapsack algorithm is the larg⁃est,and there is no way to choose the object according to the user's preference,a method of introducing the preference value is proposed to realize the application of greedy algorithm with preference.This method expands the application scope of knapsack problem.The ex⁃perimental results show that the proposed method has good applicability.

关 键 词：背包问题 贪心算法 满意解 偏好值 扩展应用 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]