Bally, V. and Pagès, G. (2003). A quantization algorithm for solving multi-dimensional discrete-time optimal stopping problems. Bernoulli
Bally, V., Pagès, G. and Printemps, J. (2005). A quantization tree method for pricing and hedging multidimensional American options. Math. Finance
Bouton, C. and Pagès, G. (1997). About the multidimensional competitive learning vector quantization algorithm with constant gain. Ann. Appl. Prob.
Chiquet, J. and Limnios, N. (2008). A method to compute the transition function of a piecewise deterministic Markov process with application to reliability. Statist. Prob. Lett.
Davis, M. H. A. (1993). Markov Models and Optimization (Monogr. Statist. Appl. Prob. 49). Chapman & Hall, London.
De Saporta, B., Dufour, F. and Gonzalez, K. (2010). Numerical method for optimal stopping of piecewise deterministic Markov processes. Ann. Appl. Prob.
Gray, R. M. and Neuhoff, D. L. (1998). Quantization. IEEE Trans. Inf. Theory
Helmes, K., Röhl, S. and Stockbridge, R. H. (2001). Computing moments of the exit time distribution for Markov processes by linear programming. Operat. Res.
Lasserre, J.-B. and Prieto-Rumeau, T. (2004). SDP vs. LP relaxations for the moment approach in some performance evaluation problems. Stoch. Models
Pagès, G., Pham, H. and Printemps, J. (2004). Optimal quantization methods and applications to numerical problems in finance. In Handbook of Computational and Numerical Methods in Finance, Birkhäuser, Boston, MA, pp. 253–297.