Recoverable robust knapsacks: the discrete scenario case (Q691430): Difference between revisions

@@ Property / cites work @@
+SCIP: solving constraint integer programs
@@ Property / cites work: SCIP: solving constraint integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of min-max and min-max regret versions of some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+Recoverable robust knapsacks: the discrete scenario case
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Recoverable Robustness in Shunting and Timetabling
+Normal rank
@@ Property / cites work @@
+A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
+Normal rank
@@ Property / cites work @@
+A note on the max-min 0-1 knapsack problem
@@ Property / cites work: A note on the max-min 0-1 knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Separation algorithms for 0-1 knapsack polytopes
@@ Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
+Normal rank
@@ Property / cites work @@
+The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(0/1\) knapsack polytope
@@ Property / cites work: On the \(0/1\) knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Faces for a linear inequality in 0–1 variables
@@ Property / cites work: Faces for a linear inequality in 0–1 variables / rank @@
+Normal rank
@@ Property / cites work @@
+On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
+Normal rank