A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (Q3646120): Difference between revisions

@@ Property / cites work @@
+Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
+Normal rank
@@ Property / cites work @@
+Approximating probability density functions and their convolutions using orthogonal polynomials
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+Bounding the Project Completion Time Distribution in PERT Networks
+Normal rank
@@ Property / cites work @@
+Q3226016
@@ Property / cites work: Q3226016 / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic spanning tree problem
@@ Property / cites work: Stochastic spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5605168
@@ Property / cites work: Q5605168 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding Distributions for a Stochastic Acyclic Network
+Normal rank
@@ Property / cites work @@
+A computational study on bounding the makespan distribution in stochastic project networks
+Normal rank
@@ Property / cites work @@
+Distribution of the Time Through a Directed, Acyclic Network
+Normal rank
@@ Property / cites work @@
+Application of a Technique for Research and Development Program Evaluation
+Normal rank
@@ Property / cites work @@
+Hedging uncertainty: approximation algorithms for stochastic optimization problems
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4121706
@@ Property / cites work: Q4121706 / rank @@
+Normal rank