The Collapsing 0–1 Knapsack Problem
From MaRDI portal
Cites work
- A Branch Search Algorithm for the Knapsack Problem
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for Nonlinear Knapsack Problems
- An Efficient Algorithm for the 0-1 Knapsack Problem
- An Improved Implicit Enumeration Approach for Integer Programming
- scientific article; zbMATH DE number 3310598 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- scientific article; zbMATH DE number 3423545 (Why is no real title available?)
- Mixed-integer Algorithms for the (0,1) Knapsack Problem
- Pseudo-Boolean Programming
- Reduction Algorithm for Zero-One Single Knapsack Problems
Cited in
(8)- An exact algorithm for the 0-1 collapsing knapsack problem
- Simple but efficient approaches for the collapsing knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- A new exact approach for the 0-1 collapsing knapsack problem
- An efficient algorithm for the collapsing knapsack problem
- The continuous collapsing Knapsack problem
- A dual approach for the continuous collapsing knapsack problem
- On a cardinality constrained linear programming knapsack problem
This page was built for publication: The Collapsing 0–1 Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175049)
