Tight bounds for periodicity theorems on the unbounded knapsack problem

DOI10.1016/j.ejor.2011.06.010zbMath1237.90197OpenAlexW2112546682MaRDI QIDQ421659

J. Herrera, H. S. Yoon

Publication date: 14 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.010

zbMATH Keywords

integer programmingperiodicitycombinatorial optimizationknapsack problemnumber theory

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Determining the \(K\)-best solutions of knapsack problems, A constructive periodicity bound for the unbounded knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new lower bound for the linear knapsack problem with general integer variables
• A hybrid algorithm for the unbounded knapsack problem
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
• Average performance of greedy heuristics for the integer knapsack problem.
• Unbounded knapsack problem: Dynamic programming revisited
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
• Computational aspects of hard knapsack problems.
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• The Theory and Computation of Knapsack Functions
• Turnpike Theorems for Integer Programming Problems