On a cardinality constrained linear programming knapsack problem

DOI10.1016/0167-6377(89)90063-1zbMATH Open0716.90077OpenAlexW2087015787MaRDI QIDQ753684FDOQ753684

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4143769
• scientific article; zbMATH DE number 2086929
• A polyhedral study of the cardinality constrained knapsack problem
• An exact algorithm for the 0-1 collapsing knapsack problem
• On the solution of concave knapsack problems

zbMATH Keywords

continuous relaxationcardinality constrained linear programming knapsack problem

Mathematics Subject Classification ID

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

Cites Work

• An Algorithm for Large Zero-One Knapsack Problems
• Exact methods for the knapsack problem and its generalizations
• An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cardinality Constrained Decomposition
• Title not available (Why is that?)

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)