
## References

Pieter Abbeel, Varun Ganapathi, and Andrew Y. Ng. Learning vehicular dynamics, with application to modeling helicopters. In *Advances in Neural Information Processing Systems*, pages 1–8, 2006.

Daniel Adelman. A price-directed approach to stochastic inventory/routing. *Operations* Research, 52:499–514, 2004.

Richard Bellman. *Dynamic Programming*. Princeton University Press, 1957.

Kristin P. Bennett and Olvi L. Mangasarian. Bilinear separation of two sets in n-space.

Technical report, Computer Science Department, University of Wisconsin, 1992.

Dimitri P. Bertsekas and Sergey Ioffe. Temporal differences-based policy iteration and applications in neuro-dynamic programming. Technical Report LIDS-P-2349, LIDS, 1997.

Dimitri P. Bertsekas and John N. Tsitsiklis. *Neuro-dynamic programming*. Athena Scientific, 1996.
Alberto Carpara and Michele Monaci. Bidimensional packing by bilinear programming.

Mathematical Programming Series A, 118:75–108, 2009.

Daniela P. de Farias. *The Linear Programming Approach to Approximate Dynamic Programming: Theory and Application*. PhD thesis, Stanford University, 2002.

Daniela P. de Farias and Ben van Roy. The linear programming approach to approximate dynamic programming. *Operations Research*, 51:850–856, 2003.

Daniela Pucci de Farias and Benjamin van Roy. On constraint sampling in the linear programming approach to approximate dynamic programming. *Mathematics of Operations* Research, 29(3):462–478, 2004.

Carlos Guestrin, Daphne Koller, Ronald Parr, and Shobha Venkataraman. Efficient solution algorithms for factored MDPs. *Journal of Artificial Intelligence Research*, 19:399–468, 2003.

Reiner Horst and Hoang Tuy. *Global optimization: Deterministic approaches*. Springer, 1996.
Michail G. Lagoudakis and Ronald Parr. Least-squares policy iteration. *Journal of Machine* Learning Research, 4:1107–1149, 2003.

Olvi L. Mangasarian. The linear complementarity problem as a separable bilinear program.

Journal of Global Optimization, 12:1–7, 1995.

Remi Munos. Error bounds for approximate policy iteration. In *International Conference* on Machine Learning, pages 560–567, 2003.

Marek Petrik and Shlomo Zilberstein. Anytime coordination using separable bilinear programs. In *Conference on Artificial Intelligence*, pages 750–755, 2007.