An efficient algorithm for the collapsing knapsack problem
From MaRDI portal
Publication:2489216
Recommendations
Cites work
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
- An Algorithm for Large Zero-One Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- An exact algorithm for the 0-1 collapsing knapsack problem
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Quicksort
- Simple but efficient approaches for the collapsing knapsack problem
- The Collapsing 0–1 Knapsack Problem
Cited in
(8)- An exact algorithm for the 0-1 collapsing knapsack problem
- Simple but efficient approaches for the collapsing knapsack problem
- A new exact approach for the 0-1 collapsing knapsack problem
- Cost based filtering for the constrained knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A dual approach for the continuous collapsing knapsack problem
- scientific article; zbMATH DE number 1973871 (Why is no real title available?)
- A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
This page was built for publication: An efficient algorithm for the collapsing knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489216)