The Unbounded Knapsack Problem

DOI10.1007/978-3-540-76796-1_10zbMath1359.90120OpenAlexW145184266MaRDI QIDQ2971610

No author found.

Publication date: 7 April 2017

Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_10

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem

Cites Work

• An exact algorithm for large unbounded knapsack problems
• An algorithm for the periodic solutions in the knapsack problem
• Dynamic programming on the word RAM
• Unbounded knapsack problem: Dynamic programming revisited
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• The Theory and Computation of Knapsack Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Unbounded Knapsack Problem