Algorithms for the bounded set-up knapsack problem
From MaRDI portal
Publication:2467131
DOI10.1016/j.disopt.2006.11.002zbMath1163.90717MaRDI QIDQ2467131
Laura A. McLay, Jacobson, Sheldon H.
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
Related Items
Generalized quadratic multiple knapsack problem and two solution approaches, A dynamic programming algorithm for the knapsack problem with setup, A new effective dynamic program for an investment optimization problem, An exact approach for the 0-1 knapsack problem with setups, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Solving 0-1 knapsack problems based on amoeboid organism algorithm, Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Uses Software
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
