A new exact approach for the 0-1 collapsing knapsack problem
DOI10.1016/J.EJOR.2016.12.009zbMATH Open1402.90143OpenAlexW2560610578MaRDI QIDQ1753399FDOQ1753399
Authors: Fabio Salassa, Rosario Scatamacchia, F. 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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- An exact algorithm for the 0-1 collapsing knapsack problem
- An exact approach for the 0-1 knapsack problem with setups
- Simplex algorithms for linear programming
- The Collapsing 0–1 Knapsack Problem
- Simple but efficient approaches for the collapsing knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- An efficient algorithm for the collapsing knapsack problem
- A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
Cited In (11)
- Simple but efficient approaches for the collapsing knapsack problem
- An efficient algorithm for the collapsing knapsack problem
- A dual approach for the continuous collapsing knapsack problem
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Approximating the 3-period incremental knapsack problem
- A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
- On approximating the incremental knapsack problem
- An exact algorithm for the 0-1 collapsing knapsack problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: A new exact approach for the 0-1 collapsing knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753399)
