A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983): 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.1016/j.orl.2010.01.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1976174751
@@ Property / OpenAlex ID: W1976174751 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
+Normal rank
@@ Property / cites work @@
+Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4527034
@@ Property / cites work: Q4527034 / rank @@
+Normal rank
@@ Property / cites work @@
+The Dynamic and Stochastic Knapsack Problem with Random Sized Items
+Normal rank
@@ Property / cites work @@
+The Dynamic and Stochastic Knapsack Problem with Deadlines
+Normal rank