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 条
  • [21] Dynamic programming algorithms for the hi-objective integer knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (01) : 85 - 99
  • [22] A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
    Fomeni, Franklin Djeumou
    DISCRETE APPLIED MATHEMATICS, 2023, 335 : 52 - 68
  • [23] Comparative Analysis of the Efficiency of Various Dynamic Programming Algorithms for the Knapsack Problem
    Posypkin, Mikhail
    Si Thu Thant Sin
    PROCEEDINGS OF THE 2016 IEEE NORTH WEST RUSSIA SECTION YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING CONFERENCE (ELCONRUSNW), 2016, : 313 - 316
  • [24] Dynamic programming and strong bounds for the 0-1 knapsack problem
    Martello, S
    Pisinger, D
    Toth, P
    MANAGEMENT SCIENCE, 1999, 45 (03) : 414 - 424
  • [25] Improved Dynamic Programming Algorithms for the 0-1 Knapsack Problem
    Meng, Xiaohua
    Zhu, Yue-an
    Wu, Xiaoming
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 8, 2010, : 19 - 22
  • [26] An exact algorithm for the knapsack sharing problem
    Hifi, M
    M'Halla, H
    Sadfi, S
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (05) : 1311 - 1324
  • [27] An efficient algorithm for the Knapsack Sharing Problem
    Hifi, M
    Sadfi, S
    Sbihi, A
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 23 (01) : 27 - 45
  • [28] The knapsack sharing problem: An exact algorithm
    Hifi, M
    Sadfi, S
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (01) : 35 - 54
  • [29] An Efficient Algorithm for the Knapsack Sharing Problem
    Mhand Hifi
    Slim Sadfi
    Abdelkader Sbihi
    Computational Optimization and Applications, 2002, 23 : 27 - 45
  • [30] The Knapsack Sharing Problem: An Exact Algorithm
    Mhand Hifi
    Slim Sadfi
    Journal of Combinatorial Optimization, 2002, 6 : 35 - 54
12345