Cécile Murat

Orcid: 0000-0001-8888-3685

According to our database1, Cécile Murat authored at least 27 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximating the probabilistic p-Center problem under pressure.
J. Comb. Optim., August, 2024

2020
A robust <i>p</i>-Center problem under pressure to locate shelters in wildfire context.
EURO J. Comput. Optim., 2020

Hardness and approximation of the Probabilistic p-Center problem under Pressure.
CoRR, 2020

2018
QoS-aware automatic syntactic service composition problem: Complexity and resolution.
Future Gener. Comput. Syst., 2018

Portfolio optimization with <i>pw</i>-robustness.
EURO J. Comput. Optim., 2018

The probabilistic minimum dominating set problem.
Discret. Appl. Math., 2018

The probabilistic k-center problem.
Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, 2018

2015
Web services composition: Complexity and models.
Discret. Appl. Math., 2015

2014
Recent advances in robust optimization: An overview.
Eur. J. Oper. Res., 2014

Robust location transportation problems under uncertain demands.
Discret. Appl. Math., 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

2013
New models for the robust shortest path problem: complexity, resolution and generalization.
Ann. Oper. Res., 2013

The Probabilistic Min Dominating Set Problem.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
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

2010
Linear programming with interval right hand sides.
Int. Trans. Oper. Res., 2010

Recourse problem of the 2-stage robust location transportation problem.
Electron. Notes Discret. Math., 2010

Probabilistic optimization in graph-problems.
Algorithmic Oper. Res., 2010

2009
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim., 2009

2008
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

2006
On the probabilistic minimum coloring and minimum <i>k</i>-coloring.
Discret. Appl. Math., 2006

2005
Probabilistic Coloring of Bipartite and Split Graphs.
Proceedings of the Computational Science and Its Applications, 2005

2003
The Probabilistic Minimum Coloring Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002
A priori optimization for the probabilistic maximum independent set problem.
Theor. Comput. Sci., 2002

1999
The probabilistic longest path problem.
Networks, 1999

1997
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts.
Ann. Oper. Res., 1997


  Loading...