The Value of Side Information in Shortest Path Optimization
From MaRDI portal
Publication:5347832
DOI10.1109/TAC.2011.2105744zbMath1368.90163OpenAlexW2131727065MaRDI QIDQ5347832
Michael Rinehart, Munther A. Dahleh
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2011.2105744
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Measures of information, entropy (94A17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Combinatorial probability (60C99)
Related Items
An approach to the distributionally robust shortest path problem ⋮ The value of side information in network flow optimization
