According to our database1, Cécile Murat
Legend:Book In proceedings Article PhD thesis Other
QoS-aware automatic syntactic service composition problem: Complexity and resolution.
Future Generation Comp. Syst., 2018
The probabilistic minimum dominating set problem.
Discrete Applied Mathematics, 2018
Web services composition: Complexity and models.
Discrete Applied Mathematics, 2015
Recent advances in robust optimization: An overview.
European Journal of Operational Research, 2014
Robust location transportation problems under uncertain demands.
Discrete Applied Mathematics, 2014
Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming.
Proceedings of the Service-Oriented Computing - 12th International Conference, 2014
New models for the robust shortest path problem: complexity, resolution and generalization.
Annals OR, 2013
The Probabilistic Min Dominating Set Problem.
Proceedings of the Computer Science - Theory and Applications, 2013
On the probabilistic min spanning tree Problem.
J. Math. Model. Algorithms, 2012
A new 0-1 linear program for QoS and transactional-aware web service composition.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012
Linear programming with interval right hand sides.
Recourse problem of the 2-stage robust location transportation problem.
Electronic Notes in Discrete Mathematics, 2010
Probabilistic optimization in graph-problems.
Algorithmic Operations Research, 2010
On the Probabilistic min spanning tree problem.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2010
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim., 2009
Best and Worst Optimum for Linear Programs with Interval Right Hand Sides.
Proceedings of the Modelling, 2008
Vertex-Uncertainty in Graph-Problems.
Proceedings of the Combinatorial Optimization and Applications, 2008
On the probabilistic minimum coloring and minimum k-coloring.
Discrete Applied Mathematics, 2006
Probabilistic Coloring of Bipartite and Split Graphs.
Proceedings of the Computational Science and Its Applications, 2005
The Probabilistic Minimum Coloring Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
A priori optimization for the probabilistic maximum independent set problem.
Theor. Comput. Sci., 2002
The probabilistic longest path problem.
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts.
Annals OR, 1997