[8] D. Fowler and K. Brown. (2000) Branching constraint satisfaction problems for solutions robust under likely changes. In *Proceedings of 6th International Conference on Principles and Practices* of Constraint Programming**. Springer-Verlag.**
[9] E. Freuder and R. Wallace. (1992). Partial constraint satisfaction. *Artificial Intelligence***, 58:21–70.**
[10] P. Van Hentenryck, L. Michel, L. Perron, and J-C. Regin. **(1999). Constraint programming in**
OPL. In G. Nadathur, editor, *Principles and Practice of Declarative Programming***, LNCS 1702,** pages 97–116. Springer-Verlag.

[11] H. Konno and H. Yamazaki. (1991). Mean-absolute deviation portfolio optimization model for its applications to Tokyo stock market. *Management Science***, 37:519–531.**
[12] H. Konno. (1990). Piecewise linear risk functions and portfolio optimization. *Journal of the* Operations Research Society of Japan**, 33:139–156.**
[13] P. Kouvelis and G. Yu. (1996) *Robust Discrete Optimization and Its Applications***. Nonconvex**
optimization and its applications: volume 14. Kluwer.

[14] M. L. Littman, J. Goldsmith, and M. Mundhenk. (1998). The computational complexity of probabilistic plan existence and evaluation. *Journal of Artificial Intelligence Research***, 9:1–36.**
[15] M. L. Littman, S. M. Majercik, and T. Pitassi. (2001). Stochastic boolean satisfiability. Journal of Automated Reasoning**. 27:251–296.**
[16] H. M. Markowitz. (1952). Portfolio selection. *Journal of Finance***, 7:77–91.** [17] M. D. McKay, R. J. Beckman, and W. J. Conover. (1979). A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. *Technometrics*,
21(2):239–245.

[18] J. M. Mulvey, R. J. Vanderbei, and S. A. Zenios. (1995). Robust optimization of large-scale systems. *Operations Research***, 43:264–281.**
[19] R. M. Oliver and J. Q. Smith. (1990). *Influence Diagrams, Belief Nets and Decision Analysis*.

John Wiley and Sons.

[20] L. Proll and B. M. Smith. (1998). Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem. *INFORMS Journal of Computing***, 10:265–275.**
[21] M. L. Puterman. (1994). *Markov decision processes: discrete stochastic dynamic programming*.

John Wiley and Sons.

[22] S. Rachev and L. Ruschendorf. (1998). *Mass Transportation Problems, Vol.I: Theory***. Springer.**
[23] S. Rachev and L. Ruschendorf. (1998). *Mass Transportation Problems, Vol.II: Applications*.

Springer.

[24] A. Ruszczynski and A. Shapiro. (2003). *Stochastic Programming, Handbooks in OR/MS, Vol:10*.
Elsevier Science B.V.

28