Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707): Difference between revisions

@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+The Recoverable Robust Two-Level Network Design Problem
+Normal rank
@@ Property / cites work @@
+Canonical Cuts on the Unit Hypercube
@@ Property / cites work: Canonical Cuts on the Unit Hypercube / 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: Γ-Scenarios
@@ Property / cites work: Recoverable Robust Knapsacks: Γ-Scenarios / rank @@
+Normal rank
@@ Property / cites work @@
+Recoverable robust knapsacks: the discrete scenario case
+Normal rank
@@ Property / cites work @@
+Recoverable Robustness in Shunting and Timetabling
+Normal rank
@@ Property / cites work @@
+Cutting plane versus compact formulations for uncertain (integer) linear programs
+Normal rank
@@ Property / cites work @@
+Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
+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 @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
+Normal rank
@@ Property / cites work @@
+Q4605945
@@ Property / cites work: Q4605945 / rank @@
+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 Robust Knapsack Problem
@@ Property / cites work: On the Robust Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solution of the robust knapsack problem
@@ Property / cites work: Exact solution of the robust knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting-set methods for robust convex optimization with pessimizing oracles
+Normal rank
@@ Property / cites work @@
+Where are the hard knapsack problems?
@@ Property / cites work: Where are the hard knapsack problems? / rank @@
+Normal rank
@@ Property / cites work @@
+On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
+Normal rank