A constructive periodicity bound for the unbounded knapsack problem

DOI10.1016/j.orl.2012.05.001zbMath1251.90323OpenAlexW2053370990MaRDI QIDQ1758270

Xianqiang Yang

Publication date: 8 November 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.05.001

zbMATH Keywords

integer programmingperiodicitycombinatorial optimizationknapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight bounds for periodicity theorems on the unbounded knapsack problem
• Unbounded knapsack problems with arithmetic weight sequences
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
• When the Greedy Solution Solves a Class of Knapsack Problems
• The Theory and Computation of Knapsack Functions
• A polynomially solvable special case of the unbounded knapsack problem

This page was built for publication: A constructive periodicity bound for the unbounded knapsack problem