This is a preview. Log in through your library . Abstract Nonstationary infinite-horizon Markov decision processes (MDPs) generalize the most well-studied class of sequential decision models in ...

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers. Journal Information ...