On a cardinality constrained linear programming knapsack problem (Q753684): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(89)90063-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2087015787
@@ Property / OpenAlex ID: W2087015787 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
+Normal rank
@@ Property / cites work @@
+An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
+Normal rank
@@ Property / cites work @@
+Exact methods for the knapsack problem and its generalizations
+Normal rank
@@ Property / cites work @@
+The Collapsing 0–1 Knapsack Problem
@@ Property / cites work: The Collapsing 0–1 Knapsack Problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:753684