On a cardinality constrained linear programming knapsack problem

The paper presents an O( n 2) method for solving the cardinality constrained linear programming knapsack problem. The method improves the O( n 3) algorithm of Campello and Maculan (1987, 1988). An O( n 2log n) method for the continuous relaxation of the 0–1 collapsing knapsack problem is discussed....

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 1989, Vol.8 (4), p.215-218
Main Author: Dudzinski, Krzyszof
Format: Article
Language:English
Subjects:
Applied sciences
collapsing knapsack
Exact sciences and technology
Flows in networks. Combinatorial problems
knapsack problem
linear programming
Operational research and scientific management
Operational research. Management science
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper presents an O( n 2) method for solving the cardinality constrained linear programming knapsack problem. The method improves the O( n 3) algorithm of Campello and Maculan (1987, 1988). An O( n 2log n) method for the continuous relaxation of the 0–1 collapsing knapsack problem is discussed. Computational experiments are reported.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(89)90063-1