Algorithms for the bounded set-up knapsack problem
From MaRDI portal
Publication:2467131
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Minimal Algorithm for the Bounded 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
- Title not available (Why is that?)
- Exact Algorithms For The Setup Knapsack Problem
- A multilevel passenger screening problem for aviation security
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Polyhedral results for the precedence-constrained knapsack problem
- Algorithms for the Longest Common Subsequence Problem
- Approximation Algorithms for Certain Scheduling Problems
- Lifting cover inequalities for the precedence-constrained knapsack problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A General Algorithm for One-Dimensional Knapsack Problems
Cited In (14)
- Integer knapsack problems with set-up weights
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Title not available (Why is that?)
- A Minimal Algorithm for the Bounded Knapsack Problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Generalized quadratic multiple knapsack problem and two solution approaches
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Pseudopolynomial algorithms for the solution of backpack problems
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- A dynamic programming algorithm for the knapsack problem with setup
- Knapsack problems with setups
- A new effective dynamic program for an investment optimization problem
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- An exact approach for the 0-1 knapsack problem with setups
Uses Software
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)
