A new exact approach for the 0-1 collapsing knapsack problem

DOI10.1016/j.ejor.2016.12.009zbMath1402.90143OpenAlexW2560610578MaRDI QIDQ1753399

Rosario Scatamacchia, Fabio Salassa, Frederico Della Croce

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.009

zbMATH Keywords

branch and bound0-1 programmingexact algorithmcollapsing knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (4)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ On approximating the incremental knapsack problem ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ Approximating the 3-period incremental knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• An exact algorithm for the 0-1 collapsing knapsack problem
• Simple but efficient approaches for the collapsing knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Approximation algorithms for knapsack problems with cardinality constraints
• An exact approach for the 0-1 knapsack problem with setups
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• An efficient algorithm for the collapsing knapsack problem
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• The Collapsing 0–1 Knapsack Problem
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM

This page was built for publication: A new exact approach for the 0-1 collapsing knapsack problem