Name
Abstract | ||
|---|---|---|
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains with prescribed initial and final marginals. From a computational standpoint, viewing scheduling this way is especially attractive in light of the existence of an ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TAC.2017.2763418 | IEEE Transactions on Automatic Control |
Keywords | Field | DocType |
Bridges,Entropy,Robustness,Temperature,Markov processes,Transportation,Electronic mail | Flow network,Mathematical optimization,Equal-cost multi-path routing,Markov process,Static routing,Iterative method,Markov chain,Routing domain,Robustness (computer science),Mathematics | Journal |
Volume | Issue | ISSN |
63 | 7 | 0018-9286 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongxin Chen | 1 | 99 | 31.89 |
| Tryphon T. Georgiou | 2 | 211 | 36.71 |
| Michele Pavon | 3 | 223 | 25.98 |
| Allen Tannenbaum | 4 | 3629 | 409.15 |