On a cardinality constrained linear programming knapsack problem
type: Item
instance of: scholarly article
title: On a cardinality constrained linear programming knapsack problem
zbMATH Open document ID: 0716.90077
DOI: 10.1016/0167-6377(89)90063-1
author: Krzysztof Dudzinski
published in: Operations Research Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4181137
zbMATH Keywords: cardinality constrained linear programming knapsack problem
zbMATH Keywords: continuous relaxation
MaRDI profile type: Publication
full work available at URL: 0167-6377(89)90063-1
OpenAlex ID: W2087015787
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
cites work: An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
cites work: Exact methods for the knapsack problem and its generalizations
cites work: The Collapsing 0–1 Knapsack Problem
description: scientific article; zbMATH DE number 4181137