A dynamic programming algorithm for the knapsack problem with setup
From MaRDI portal
Publication:342065
DOI10.1016/J.COR.2015.05.005zbMATH Open1349.90634OpenAlexW286695454MaRDI QIDQ342065FDOQ342065
Authors: Khalil Chebil, Mahdi Khemakhem 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.005
Recommendations
- Exact Algorithms For The Setup Knapsack Problem
- A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
- Improved dynamic programming and approximation results for the knapsack problem with setups
- An exact algorithm for the Knapsack problem with setup
- Algorithms for the bounded set-up knapsack problem
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Partitions with Applications to the Knapsack Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Knapsack problems with setups
- Algorithms for the bounded set-up knapsack problem
- Title not available (Why is that?)
- Dynamic programming algorithms for the zero-one knapsack problem
- Approximate and exact algorithms for the fixed-charge knapsack problem
- Integer knapsack problems with set-up weights
- Exact Algorithms For The Setup Knapsack Problem
- A multilevel passenger screening problem for aviation security
Cited In (22)
- A cross entropy algorithm for the Knapsack problem with setups
- Algorithms for the bounded set-up knapsack problem
- An exact algorithm for the Knapsack problem with setup
- Integer knapsack problems with set-up weights
- Exact approaches for the knapsack problem with setups
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Exact Algorithms For The Setup Knapsack Problem
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
- A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
- An iterative dynamic programming approach for the temporal knapsack problem
- The replenishment problem with multiple articles and an order threshold
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Knapsack problems with setups
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
- Improved dynamic programming and approximation results for the knapsack problem with setups
- Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
- An exact approach for the 0-1 knapsack problem with setups
Uses Software
This page was built for publication: A dynamic programming algorithm for the knapsack problem with setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342065)
