A dynamic programming algorithm for the knapsack problem with setup
From MaRDI portal
Publication:342065
DOI10.1016/j.cor.2015.05.005zbMath1349.90634OpenAlexW286695454MaRDI QIDQ342065
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
Related Items (9)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ Exact approaches for the knapsack problem with setups ⋮ A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ The replenishment problem with multiple articles and an order threshold ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Knapsack problems with setups
- Dynamic programming algorithms for the zero-one knapsack problem
- Algorithms for the bounded set-up knapsack problem
- Approximate and exact algorithms for the fixed-charge knapsack problem
- Integer knapsack problems with set-up weights
- Computing Partitions with Applications to the Knapsack Problem
- Exact Algorithms For The Setup Knapsack Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A multilevel passenger screening problem for aviation security
This page was built for publication: A dynamic programming algorithm for the knapsack problem with setup
