Information Collection on a Graph

DOI10.1287/opre.1100.0873zbMath1218.90202OpenAlexW2039521867MaRDI QIDQ3013928

Warren B. Powell, Ilya O. Ryzhov

Publication date: 19 July 2011

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0c550c0b722139663f9c184074515b0506227182

zbMATH Keywords

Bayesian learningstochastic shortest pathsranking and selectionoptimal learningknowledge gradient

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Optimal Information Blending with Measurements in the L² Sphere ⋮ The Post-Disaster Debris Clearance Problem Under Incomplete Information ⋮ On the Convergence Rates of Expected Improvement Methods ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures

This page was built for publication: Information Collection on a Graph