Randomized strategies for cardinality robustness in the knapsack problem (Q1675929): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Packing a Knapsack of Unknown Capacity
@@ Property / cites work: Packing a Knapsack of Unknown Capacity / 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 @@
+Robust Matchings
@@ Property / cites work: Robust Matchings / rank @@
+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 @@
+Randomized Strategies for Cardinality Robustness in the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+An Analysis of the Greedy Heuristic for Independence Systems
+Normal rank
@@ Property / cites work @@
+Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
+Normal rank
@@ Property / cites work @@
+Robust randomized matchings
@@ Property / cites work: Robust randomized matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy in Approximation Algorithms
@@ Property / cites work: Greedy in Approximation Algorithms / rank @@
+Normal rank