A dynamic programming algorithm for the knapsack problem with setup

DOI10.1016/J.COR.2015.05.005MaRDI QIDQ342065zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinationdynamic programmingproduction planningknapsack problemssetup

Mathematics Subject Classification ID

Dynamic programming (90C39) Integer programming (90C10) Production models (90B30)

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

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3900494 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A multilevel passenger screening problem for aviation security
• Algorithms for the bounded set-up knapsack problem
• Approximate and exact algorithms for the fixed-charge knapsack problem
• Computing Partitions with Applications to the Knapsack Problem
• Dynamic programming algorithms for the zero-one knapsack problem
• Exact Algorithms For The Setup Knapsack Problem
• Integer knapsack problems with set-up weights
• Knapsack problems with setups

Cited in

(22)

• The replenishment problem with multiple articles and an order threshold
• Algorithms for the bounded set-up knapsack problem
• A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
• Exact Algorithms For The Setup Knapsack Problem
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
• A cross entropy algorithm for the Knapsack problem with setups
• Integer knapsack problems with set-up weights
• Exact approaches for the knapsack problem with setups
• Improved dynamic programming and approximation results for the knapsack problem with setups
• An exact approach for the 0-1 knapsack problem with setups
• Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
• Knapsack problems with setups
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
• Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
• Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• An iterative dynamic programming approach for the temporal knapsack problem
• An exact algorithm for the Knapsack problem with setup

Describes a project that uses

Uses Software

• CPLEX
• Knapsack

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)