An exact approach for the 0-1 knapsack problem with setups

DOI10.1016/j.cor.2016.11.015zbMath1391.90513OpenAlexW2553041823MaRDI QIDQ1652189

Fabio Salassa, Rosario Scatamacchia, Frederico Della Croce

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.015

zbMATH Keywords

0-1 programmingexact approachknapsack problem with setups

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (11)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Exact approaches for the knapsack problem with setups ⋮ 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 ⋮ On approximating the incremental knapsack problem ⋮ 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 ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Approximating the 3-period incremental knapsack problem ⋮ A new exact approach for the 0-1 collapsing knapsack problem

Uses Software

• CPLEX
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for the knapsack problem with setup
• An exact algorithm for the Knapsack problem with setup
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• Knapsack problems with setups
• The one-machine sequencing problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Improved LP-based algorithms for the closest string problem
• A cross entropy algorithm for the Knapsack problem with setups
• Algorithms for the bounded set-up knapsack problem
• Approximate and exact algorithms for the fixed-charge knapsack problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Computing Partitions with Applications to the Knapsack Problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Exact Algorithms For The Setup Knapsack Problem
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems

This page was built for publication: An exact approach for the 0-1 knapsack problem with setups