A constructive periodicity bound for the unbounded knapsack problem
From MaRDI portal
Recommendations
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- An algorithm for the periodic solutions in the knapsack problem
- scientific article; zbMATH DE number 6869279
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- An exact algorithm for large unbounded knapsack problems
- On the multiperiod binary knapsack problem
- scientific article; zbMATH DE number 3900493
- Bounds for nested knapsack problems
- scientific article; zbMATH DE number 936863
- scientific article; zbMATH DE number 3984973
Cites work
- A polynomially solvable special case of the unbounded knapsack problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- The Theory and Computation of Knapsack Functions
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- Unbounded knapsack problems with arithmetic weight sequences
- When the Greedy Solution Solves a Class of Knapsack Problems
Cited in
(6)- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- The unbounded knapsack problem
- Analysis of the knapsack problem using L-partition
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- scientific article; zbMATH DE number 936863 (Why is no real title available?)
This page was built for publication: A constructive periodicity bound for the unbounded knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758270)
