Algorithms for the bounded set-up knapsack problem

DOI10.1016/j.disopt.2006.11.002zbMath1163.90717MaRDI QIDQ2467131

Jacobson, Sheldon H., Laura A. McLay

Publication date: 18 January 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.11.002

zbMATH Keywords

dynamic programming; knapsack problems; fully polynomial-time approximation schemes

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90C39: Dynamic programming

Related Items

Solving 0-1 knapsack problems based on amoeboid organism algorithm

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting cover inequalities for the precedence-constrained knapsack problem
• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• Polyhedral results for the precedence-constrained knapsack problem
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• Dynamic programming revisited: Improving knapsack algorithms
• Integer knapsack problems with set-up weights
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A General Algorithm for One-Dimensional Knapsack Problems
• Algorithms for the Longest Common Subsequence Problem
• Approximation Algorithms for Certain Scheduling Problems
• Exact Algorithms For The Setup Knapsack Problem
• A Minimal Algorithm for the Bounded Knapsack Problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• A multilevel passenger screening problem for aviation security