Lifting of probabilistic cover inequalities (Q1728321): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.orl.2017.08.006
-Normal rank
@@ Property / OpenAlex ID @@
-W2742759454
@@ Property / OpenAlex ID: W2742759454 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2017.08.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2742759454
@@ Property / OpenAlex ID: W2742759454 / rank @@
+Normal rank
@@ Property / cites work @@
+Polymatroids and mean-risk minimization in discrete optimization
+Normal rank
@@ Property / cites work @@
+The submodular knapsack polytope
@@ Property / cites work: The submodular knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the Knapsack Polytope From Minimal Covers
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Programming
@@ Property / cites work: Introduction to Stochastic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Chance-Constrained Programming
@@ Property / cites work: Chance-Constrained Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for the chance-constrained knapsack problem with random item sizes
+Normal rank
@@ Property / cites work @@
+Robust optimization approach for a chance-constrained binary knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Allocating Bandwidth for Bursty Connections
@@ Property / cites work: Allocating Bandwidth for Bursty Connections / rank @@
+Normal rank
@@ Property / cites work @@
+A robust approach to the chance-constrained knapsack problem
+Normal rank
@@ Property / cites work @@
+Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / 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 @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Chance-Constrained Binary Packing Problems
@@ Property / cites work: Chance-Constrained Binary Packing Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Easily Computable Facets of the Knapsack Polytope
@@ Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank @@
+Normal rank