On a cardinality constrained linear programming knapsack problem

DOI10.1016/0167-6377(89)90063-1zbMath0716.90077OpenAlexW2087015787MaRDI QIDQ753684

Krzysztof Dudzinski

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90063-1

zbMATH Keywords

continuous relaxationcardinality constrained linear programming knapsack problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• 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
• An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
• An Algorithm for Large Zero-One Knapsack Problems
• The Collapsing 0–1 Knapsack Problem

This page was built for publication: On a cardinality constrained linear programming knapsack problem