Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

被引：0
|
作者：
Hans Kellerer
Ulrich Pferschy
机构：
[1] University of Graz,Department of Statistics and Operations Research
来源：
Journal of Combinatorial Optimization | 2004年 / 8卷
关键词：
dynamic programming; knapsack problem; fully polynomial approximation scheme;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A vector merging problem is introduced where two vectors of length n are merged such that the k-th entry of the new vector is the minimum over ℓ of the ℓ-th entry of the first vector plus the sum of the first k − ℓ + 1 entries of the second vector. For this problem a new algorithm with O(n log n) running time is presented thus improving upon the straightforward O(n2) time bound.
引用
收藏
页码：5 / 11
页数：6
相关论文
共 50 条
  • [1] Improved dynamic programming in connection with an FPTAS for the knapsack problem
    Kellerer, H
    Pferschy, U
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (01) : 5 - 11
  • [2] An FPTAS for the parametric knapsack problem
    Holzhauser, Michael
    Krumke, Sven O.
    INFORMATION PROCESSING LETTERS, 2017, 126 : 43 - 47
  • [3] Improved dynamic programming and approximation results for the knapsack problem with setups
    Pferschy, Ulrich
    Scatamacchia, Rosario
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (02) : 667 - 682
  • [4] An FPTAS for the knapsack problem with parametric weights
    Halman, Nir
    Holzhauser, Michael
    Krumke, Sven O.
    OPERATIONS RESEARCH LETTERS, 2018, 46 (05) : 487 - 491
  • [5] A faster FPTAS for the Unbounded Knapsack Problem
    Jansen, Klaus
    Kraft, Stefan E. J.
    EUROPEAN JOURNAL OF COMBINATORICS, 2018, 68 : 148 - 174
  • [6] 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
  • [7] A faster FPTAS for knapsack problem with cardinality constraint
    Li, Wenxin
    Lee, Joohyun
    Shroff, Ness
    DISCRETE APPLIED MATHEMATICS, 2022, 315 : 71 - 85
  • [8] A dynamic programming algorithm for the bilevel knapsack problem
    Brotcorne, Luce
    Hanafi, Said
    Mansi, Raid
    OPERATIONS RESEARCH LETTERS, 2009, 37 (03) : 215 - 218
  • [9] Unbounded knapsack problem: Dynamic programming revisited
    Andonov, R
    Poirriez, V
    Rajopadhye, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) : 394 - 407
  • [10] A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
    Fomeni, Franklin Djeumou
    Letchford, Adam N.
    INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) : 173 - 182
12345