首页 | 官方网站   微博 | 高级检索  
     


New reduction strategy in the biobjective knapsack problem
Authors:Malika Daoud  Djamal Chaabane
Affiliation:1. Faculty of Mathematics, Department of Operations Research, Algeria;2. Laboratory AMCD‐RO
Abstract:In this paper, the admissible region of a biobjective knapsack problem is our main interest. Although the reduction of feasible region has been studied by some authors, yet more investigation has to be done in order to deeply explore the domain before solving the problem. We propose, however, a new technique based on extreme supported efficient solutions combined with the dominance relationship between items' efficiency. An illustration of the algorithm by a didactic example is given and some experiments are presented, showing the efficiency of the procedure compared to the previous techniques found in the literature.
Keywords:efficient solution  knapsack problem  regular variable  multiple objective
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号