The value of side information in network flow optimization
From MaRDI portal
Publication:450702
Recommendations
Cites work
- Bounds for the expected value of information
- Convex majorization with an application to the length of critical paths
- Inequalities for the Completion Times of Stochastic PERT Networks
- On Shortest Paths in Graphs with Random Weights
- On sharpness of Tchebycheff-type inequalities
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Sharp Bounds on the Value of Perfect Information
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- Stochastic Programs with Incomplete Information
- TIGHT BOUNDS ON EXPECTED ORDER STATISTICS
- The Value of Information and Stochastic Programming
- The Value of Side Information in Shortest Path Optimization
This page was built for publication: The value of side information in network flow optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450702)