Computing knapsack solutions with cardinality robustness (Q1926647): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s13160-012-0075-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1994753237
@@ Property / OpenAlex ID: W1994753237 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+Q3182207
@@ Property / cites work: Q3182207 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Matchings and Matroid Intersections
@@ Property / cites work: Robust Matchings and Matroid Intersections / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579461
@@ Property / cites work: Q3579461 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Matchings
@@ Property / cites work: Robust Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4119222
@@ Property / cites work: Q4119222 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Independence Systems
@@ Property / cites work: Robust Independence Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Knapsack Solutions with Cardinality Robustness
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of the Greedy Heuristic for Independence Systems
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A General Approach for Incremental Approximation and Hierarchical Clustering
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+The Online Median Problem
@@ Property / cites work: The Online Median Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247440
@@ Property / cites work: Q4247440 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Independence Functions
@@ Property / cites work: Note on Independence Functions / rank @@
+Normal rank