M. Bellalouna, Problèmes d'Optimisation Combinatoire Probabilistes, Ecole National des Ponts et Chaussées, 1993.

M. Bellalouna, S. Souissi, and B. Ycart, Average-Case Analysis for the Probabilistic Bin Packing Problem, Trends in Mathematics, pp.149-159, 2004.
DOI : 10.1007/978-3-0348-7915-6_15

M. Bellalouna and L. Horchani, The Two-Dimensional Probabilistic Bin- Packing Problem : An average case analysis, International journal of mathematics and computer in simulation, pp.42-46, 2008.

M. Bellalouna and Z. Bouyahia, A Priori Parallel Machines Scheduling Computers & Industrial Engineering, 2010.

D. Bertsimas, Probabilistic Combinatorial Optimization problems, 1988.

D. Bertsimas, The Probabilistic Minimum Spanning Tree Problem, Networks, pp.245-275, 1990.

D. Bertsimas, A Vehicule Routing Problem with Stochastic Demand, Operational Research, pp.574-585, 1992.

P. Jaillet, The Probabilistic Traveling Salesman Problems, Operations Research, 1985.

P. Jaillet, A priori solution of a Travelling Salesman Problem in which a random subset of the customers are visited, Operations research, pp.929-936, 1988.

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, The Traveling Salesman Problem, 1985.

N. Bourgeois, F. Della-croce, B. Esco¢-er, C. Murat, and V. Paschos, Probabilistic graph-coloring in bipartite and split graphs, Journal of Combinatorial Optimization, vol.3, issue.2, 2009.
DOI : 10.1007/s10878-007-9112-2
URL : https://hal.archives-ouvertes.fr/hal-00909484

C. Murat and V. Paschos, Vertex-Uncertainty in Graph-Problems, Proceedings COCOA'08, pp.139-148, 2008.
DOI : 10.1007/978-3-540-85097-7_13
URL : https://hal.archives-ouvertes.fr/hal-00957556

V. Paschos, O. Telelis, and V. Zissimopoulos, Steiner Forests on Stochastic Metric Graphs, Proceedings COCOA 07, pp.112-123, 2007.
DOI : 10.1007/978-3-540-73556-4_14

C. Murat and V. Paschos, On the probabilistic minimum coloring and minimum <mml:math altimg="si14.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-coloring, Discrete Applied Mathematics, vol.154, issue.3, pp.564-586, 2006.
DOI : 10.1016/j.dam.2005.06.007

C. Murat and V. , Paschos, probabilistic combinatorial optimization on graphs, ISTE, 2006.

C. Murat, V. Paschos, and L. 'optimisation-combinatoire-probabiliste, Optimisation combinatoire : concepts avancés, Hermès Science, 2005.

C. Murat and V. Paschos, The Probabilistic Minimum Coloring Problem, Proceedings WG'03, pp.346-357, 2003.
DOI : 10.1007/978-3-540-39890-5_30

C. Murat and V. Paschos, The probabilistic maximum independent set problem, Theoretical Computer Science, vol.270, 2002.

C. Murat and V. Paschos, The Probabilistic Minimum Vertex-covering Problem, International Transactions in Operational Research, vol.9, issue.1, 2002.
DOI : 10.1111/1475-3995.00338

C. Murat and V. Paschos, The probabilistic longest path problem, Networks, vol.33, 1999.

C. Murat and V. Paschos, The probabilistic maximum independent set problem, Proceedings ASMDA'95, 1995.

C. Murat and V. Paschos, Problème du stable probabiliste, Comptes Rendus de l'Académie des Sciences de Paris, t. 321, Série I, 1995.

M. Bellalouna, C. Murat, and V. Paschos, Probabilistic combinatorial optimization problems on graphs: A new domain in operational research, European Journal of Operational Research, vol.87, issue.3, 1995.
DOI : 10.1016/0377-2217(95)00240-5

C. Murat and V. Paschos, A priori optimization of the probabilistic maximum independent set, ISCIS'98, 1998.