A dynamic programming method with dominance technique for the knapsack sharing problem

被引：0
|
作者：
Boyer, V. [1 ]
El Baz, D. [1 ]
Elkihel, M. [1 ]
机构：
[1] CNRS, LAAS, F-31077 Toulouse, France
来源：
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词：
Max-min programming; Knapsack sharing problem; Dynamic programming; Combinatorial optimization; EXACT ALGORITHM;
D O I：
10.1109/ICCIE.2009.5223827
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we propose an original method to solve exactly the knapsack sharing problem (KSP) by using a dynamic programming with dominance technique. The original problem (KSP) is decomposed in a set of knapsack problems. Our method is tested on uncorrelated and correlated instances from the literature. Computational experiences show that our method is able to find an optimal solution of large instances within reasonable computing time.
引用
收藏
页码：348 / 353
页数：6
相关论文
共 50 条
12345