A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems

DOI10.1007/978-3-642-04944-6_8zbMath1260.90126OpenAlexW1520061120MaRDI QIDQ3646120

Ei Ando, Hirotaka Ono, Masafumi Yamashita

Publication date: 19 November 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04944-6_8

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial probability (60C05) Approximation algorithms (68W25)

Cites Work

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