A polyhedral study of the cardinality constrained knapsack problem
type: Item
instance of: scholarly article
title: A polyhedral study of the cardinality constrained knapsack problem
zbMATH Open document ID: 1023.90085
published in: Mathematical Programming. Series A. Series B
publication date: 2003-08-20T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1968540
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: knapsack problem
zbMATH Keywords: cardinality constrained programming
zbMATH Keywords: branch-and-cut
author: I. R. jun. de Farias
author: G. L. Nemhauser
describes a project that uses: MINTO
MaRDI profile type: Publication
full work available at URL: s10107-003-0420-8
OpenAlex ID: W2910445340
DOI: 10.1007/S10107-003-0420-8
Recommended article: Q4737534
Recommended article: On a cardinality constrained linear programming knapsack problem
Recommended article: A polyhedral study of the semi-continuous knapsack problem
Recommended article: Approximation algorithms for knapsack problems with cardinality constraints
Recommended article: Polyhedral results for the precedence-constrained knapsack problem
Recommended article: A polyhedral study on 0-1 knapsack problems with set packing constraints
Recommended article: Knapsack polytopes: a survey
Recommended article: Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
Recommended article: On the solution of concave knapsack problems
Recommended article: Knapsack problems: a parameterized point of view
description: scientific article; zbMATH DE number 1968540