MIT, Cambridge] and the original simplex method with the most-negative-reduced-cost pivoting rule of Dantzig are strongly polynomial-time algorithms for solving the Markov decision problem (MDP) with ...

In Klingenberg, Schnücke, and Xia (Math. Comp. 86 (2017), 1203–1232) an arbitrary Lagrangian-Eulerian discontinuous Galerkin (ALE-DG) method to solve conservation laws has been developed and analyzed.