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 条
  • [21] Revisiting Sparse Dynamic Programming for the 0/1 Knapsack Problem
    Sifat, Tarequl Islam
    Prajapati, Nirmal
    Rajopadhye, Sanjay
    PROCEEDINGS OF THE 49TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2020, 2020,
  • [22] A dynamic programming method with dominance technique for the knapsack sharing problem
    Boyer, V.
    El Baz, D.
    Elkihel, M.
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 348 - 353
  • [23] ON THE SOLUTION OF MULTIDIMENSIONAL INTEGER KNAPSACK PROBLEM WITH DYNAMIC PROGRAMMING TECHNIQUE
    Nuri, Elnur
    Nuriyeva, Fidan
    Nuriyev, Urfat
    PROCEEDINGS OF THE7TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL. 1, 2020, : 302 - 304
  • [24] An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
    Perry, Thomas C.
    Hartman, Joseph C.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2009, 16 (03) : 347 - 359
  • [25] Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem
    He, Xueqi
    Hartman, Joseph C.
    Pardalos, Panos M.
    INFORMATICA, 2016, 27 (02) : 433 - 450
  • [26] 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
  • [27] A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
    Fomeni, Franklin Djeumou
    DISCRETE APPLIED MATHEMATICS, 2023, 335 : 52 - 68
  • [28] 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
  • [29] Dynamic programming and strong bounds for the 0-1 knapsack problem
    Martello, S
    Pisinger, D
    Toth, P
    MANAGEMENT SCIENCE, 1999, 45 (03) : 414 - 424
  • [30] An FPTAS for #Knapsack and Related Counting Problems
    Gopalan, Parikshit
    Klivans, Adam
    Meka, Raghu
    Stefankovic, Daniel
    Vempala, Santosh
    Vigoda, Eric
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 817 - 826
12345