Algorithms for the bounded set-up knapsack problem

DOI10.1016/J.DISOPT.2006.11.002zbMATH Open1163.90717OpenAlexW2029343066MaRDI QIDQ2467131FDOQ2467131

Authors Laura A. Mclay, Sheldon H. Jacobson

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 programmingknapsack problemsfully polynomial-time approximation schemes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• A minimal algorithm for the bounded knapsack problem
• A dynamic programming algorithm for the knapsack problem with setup
• Exact Algorithms For The Setup Knapsack Problem
• Knapsack problems with setups
• A Minimal Algorithm for the Bounded Knapsack Problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3580280 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A General Algorithm for One-Dimensional Knapsack Problems
• A Minimal Algorithm for the Bounded Knapsack Problem
• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• A multilevel passenger screening problem for aviation security
• Algorithms for the Longest Common Subsequence Problem
• Approximation Algorithms for Certain Scheduling Problems
• Dynamic programming revisited: Improving knapsack algorithms
• Exact Algorithms For The Setup Knapsack Problem
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• Integer knapsack problems with set-up weights
• Lifting cover inequalities for the precedence-constrained knapsack problem
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• Polyhedral results for the precedence-constrained knapsack problem

Cited in

(16)

• scientific article; zbMATH DE number 3989108 (Why is no real title available?)
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• A dynamic programming algorithm for the knapsack problem with setup
• Pseudopolynomial algorithms for the solution of backpack problems
• A minimal algorithm for the bounded knapsack problem
• A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
• Integer knapsack problems with set-up weights
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• An exact approach for the 0-1 knapsack problem with setups
• A Minimal Algorithm for the Bounded Knapsack Problem
• Knapsack problems with setups
• A new effective dynamic program for an investment optimization problem
• Generalized quadratic multiple knapsack problem and two solution approaches
• Solving 0-1 knapsack problems based on amoeboid organism algorithm
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Algorithms for the bounded set-up knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467131)