Unbounded knapsack problems with arithmetic weight sequences

被引：4
|
作者：
Deineko, Vladimir G. [2 ]
Woeginger, Gerhard J. [1 ]
机构：
[1] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2011年 / 213卷 / 02期
基金：
英国工程与自然科学研究理事会;
关键词：
Combinatorial optimization; Computational complexity; Dynamic programming; Polynomially solvable special case; VARIABLES; ALGORITHM;
D O I：
10.1016/j.ejor.2011.03.028
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We investigate a special case of the unbounded knapsack problem in which the item weights form an arithmetic sequence. We derive a polynomial time algorithm for this special case with running time O(n(8)), where n denotes the number of distinct items in the instance. Furthermore, we extend our approach to a slightly more general class of knapsack instances. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：384 / 387
页数：4
相关论文
共 50 条
  • [1] A note on dominance in unbounded knapsack problems
    Johnston, RE
    Khan, LR
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1995, 12 (02) : 145 - 160
  • [2] AN EXACT ALGORITHM FOR LARGE UNBOUNDED KNAPSACK-PROBLEMS
    MARTELLO, S
    TOTH, P
    OPERATIONS RESEARCH LETTERS, 1990, 9 (01) : 15 - 20
  • [3] A NOTE ON DOMINANCE RELATION IN UNBOUNDED KNAPSACK-PROBLEMS
    DUDZINSKI, K
    OPERATIONS RESEARCH LETTERS, 1991, 10 (07) : 417 - 419
  • [4] PROBLEMS ON DENSITY OF ARITHMETIC SEQUENCES
    MULLIN, AA
    AMERICAN MATHEMATICAL MONTHLY, 1972, 79 (10): : 1118 - 1119
  • [5] Online Unbounded Knapsack
    Boeckenhauer, Hans-Joachim
    Gehnen, Matthias
    Hromkovic, Juraj
    Klasing, Ralf
    Komm, Dennis
    Lotze, Henri
    Mock, Daniel
    Rossmanith, Peter
    Stocker, Moritz
    THEORY OF COMPUTING SYSTEMS, 2025, 69 (01)
  • [6] The Unbounded Knapsack Problem
    Hu, T. C.
    Landa, Leo
    Shing, Man-Tak
    RESEARCH TRENDS IN COMBINATORIAL OPTIMIZATION, 2009, : 201 - +
  • [7] A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems
    Bromberger, Martin
    AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 329 - 345
  • [8] A hybrid algorithm for the unbounded knapsack problem
    Poirriez, Vincent
    Yanev, Nicola
    Andonov, Rumen
    DISCRETE OPTIMIZATION, 2009, 6 (01) : 110 - 124
  • [9] A genetic algorithm for the unbounded knapsack problem
    Li, KL
    Dai, KM
    Li, QH
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 1586 - 1590
  • [10] A faster FPTAS for the Unbounded Knapsack Problem
    Jansen, Klaus
    Kraft, Stefan E. J.
    EUROPEAN JOURNAL OF COMBINATORICS, 2018, 68 : 148 - 174
12345