On a cardinality constrained linear programming knapsack problem
From MaRDI portal
Recommendations
Cites work
- An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
- An Algorithm for Large Zero-One Knapsack Problems
- Exact methods for the knapsack problem and its generalizations
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
- The Collapsing 0–1 Knapsack Problem
Cited in
(7)- A polyhedral study of the cardinality constrained knapsack problem
- Minmax linear knapsack problem with grouped variables and gub
- The constrained compartmentalised knapsack problem
- scientific article; zbMATH DE number 7366679 (Why is no real title available?)
- scientific article; zbMATH DE number 4143769 (Why is no real title available?)
- Cardinality Constrained Decomposition
- scientific article; zbMATH DE number 4095212 (Why is no real title available?)
This page was built for publication: On a cardinality constrained linear programming knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753684)