1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2012
The simplex method is strongly polynomial for deterministic Markov decision processes
Ian Post, Yinyu Ye
We prove that the simplex method with the highest gain/most-negative-reduced cost pivoting rule converges in strongly polynomial time for deterministic Markov decision processes (M…
cs.DS2009★ 1 cited
An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk
Ashish Goel, Ian Post
We consider the single-source (or single-sink) buy-at-bulk problem with an unknown concave cost function. We want to route a set of demands along a graph to or from a designated ro…