The value of side information in network flow optimization

DOI10.1016/j.sysconle.2011.09.012zbMath1250.93015MaRDI QIDQ450702

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

zbMATH Keywords

stochastic optimization; control under communication constraints

Mathematics Subject Classification ID

90C15: Stochastic programming

90B15: Stochastic network models in operations research

90C27: Combinatorial optimization

93A14: Decentralized systems

94A17: Measures of information, entropy

Cites Work

• Bounds for the expected value of information
• On sharpness of Tchebycheff-type inequalities
• Convex majorization with an application to the length of critical paths
• TIGHT BOUNDS ON EXPECTED ORDER STATISTICS
• On Shortest Paths in Graphs with Random Weights
• Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
• Inequalities for the Completion Times of Stochastic PERT Networks
• Stochastic Programs with Incomplete Information
• Sharp Bounds on the Value of Perfect Information
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• The Value of Side Information in Shortest Path Optimization
• The Value of Information and Stochastic Programming