Asset Details
Do you wish to reserve the book?
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
Do you wish to request the book?
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
2024
Overview
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range R, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB). In order to increase the difficulty of solving these instances, the knapsack capacity C is usually set to a very large value. While current efficient algorithms primarily center on the Fast Fourier Transform (FFT) and (min,+)-convolution method, there is a simpler method worth considering. In this paper, based on the basic Unbounded-DP algorithm, we utilize a recent branch and bound (B&B) result and basic theory of linear Diophantine equation, and propose an improved Unbounded-DP algorithm with time complexity of O(R4) and space complexity of O(R3). Additionally, the algorithm can also solve the All-capacities unbounded knapsack problem within the complexity O(R4+C). In particular, the proof techniques required by the algorithm are primarily covered in the first-year mathematics curriculum, which is convenient for subsequent researchers to grasp.
Publisher
MDPI AG
