The value of side information in network flow optimization
DOI10.1016/J.SYSCONLE.2011.09.012zbMATH Open1250.93015OpenAlexW2003134083MaRDI QIDQ450702FDOQ450702
Authors: Michael Rinehart, Munther A. Dahleh 
Publication date: 14 September 2012
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2011.09.012
Recommendations
Combinatorial optimization (90C27) Measures of information, entropy (94A17) Stochastic programming (90C15) Stochastic network models in operations research (90B15) Decentralized systems (93A14)
Cites Work
- On sharpness of Tchebycheff-type inequalities
- Convex majorization with an application to the length of critical paths
- TIGHT BOUNDS ON EXPECTED ORDER STATISTICS
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- The Value of Information and Stochastic Programming
- Sharp Bounds on the Value of Perfect Information
- On Shortest Paths in Graphs with Random Weights
- Bounds for the expected value of information
- Inequalities for the Completion Times of Stochastic PERT Networks
- Stochastic Programs with Incomplete Information
- The Value of Side Information in Shortest Path Optimization
Cited In (1)
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)
