Cécile Murat

28 papers A 1B 1C 2Misc 1Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2024 J jnl
Approximating the probabilistic p-Center problem under pressure.
J. Comb. Optim.
Marc Demange, Marcel Adonis Haddad, Cécile Murat
2020 J jnl
A robust
EURO J. Comput. Optim.
Marc Demange, Virginie Gabrel, Marcel Adonis Haddad, Cécile Murat
2020 J jnl
Hardness and approximation of the Probabilistic p-Center problem under Pressure.
CoRR
Marc Demange, Marcel Adonis Haddad, Cécile Murat
2018 J jnl
Portfolio optimization with
EURO J. Comput. Optim.
Virginie Gabrel, Cécile Murat, Aurélie Thiele
2018 J jnl
QoS-aware automatic syntactic service composition problem: Complexity and resolution.
Future Gener. Comput. Syst.
Virginie Gabrel, Maude Manouvrier, Kamil Moreau, Cécile Murat
2018 — conf
The probabilistic k-center problem.
RSFF
Marc Demange, Marcel Adonis Haddad, Cécile Murat
2018 J jnl
The probabilistic minimum dominating set problem.
Discret. Appl. Math.
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2015 J jnl
Web services composition: Complexity and models.
Discret. Appl. Math.
Virginie Gabrel, Maude Manouvrier, Cécile Murat
2014 A conf
Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming.
ICSOC
Virginie Gabrel, Maude Manouvrier, Cécile Murat
2014 J jnl
Recent advances in robust optimization: An overview.
Eur. J. Oper. Res.
Virginie Gabrel, Cécile Murat, Aurélie Thiele
2014 J jnl
Robust location transportation problems under uncertain demands.
Discret. Appl. Math.
Virginie Gabrel, Mathieu Lacroix, Cécile Murat, Nabila Remli
2013 J jnl
New models for the robust shortest path problem: complexity, resolution and generalization.
Ann. Oper. Res.
Virginie Gabrel, Cécile Murat, Lei Wu
2013 Misc conf
The Probabilistic Min Dominating Set Problem.
CSR
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2012 C conf
A new 0-1 linear program for QoS and transactional-aware web service composition.
ISCC
Virginie Gabrel, Maude Manouvrier, Imen Megdiche, Cécile Murat
2012 J jnl
On the probabilistic min spanning tree Problem.
J. Math. Model. Algorithms
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2010 J jnl
Linear programming with interval right hand sides.
Int. Trans. Oper. Res.
Virginie Gabrel, Cécile Murat, Nabila Remli
2010 — conf
On the Probabilistic min spanning tree problem.
IMCSIT
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2010 J jnl
Probabilistic optimization in graph-problems.
Algorithmic Oper. Res.
Cécile Murat, Vangelis Th. Paschos
2010 J jnl
Recourse problem of the 2-stage robust location transportation problem.
Electron. Notes Discret. Math.
Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix
2009 J jnl
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim.
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2008 — conf
Best and Worst Optimum for Linear Programs with Interval Right Hand Sides.
MCO
Virginie Gabrel, Cécile Murat, Nabila Remli
2008 C conf
Vertex-Uncertainty in Graph-Problems.
COCOA
Cécile Murat, Vangelis Th. Paschos
2006 J jnl
On the probabilistic minimum coloring and minimum
Discret. Appl. Math.
Cécile Murat, Vangelis Th. Paschos
2005 — conf
Probabilistic Coloring of Bipartite and Split Graphs.
ICCSA (4)
Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2003 B conf
The Probabilistic Minimum Coloring Problem.
WG
Cécile Murat, Vangelis Th. Paschos
2002 J jnl
A priori optimization for the probabilistic maximum independent set problem.
Theor. Comput. Sci.
Cécile Murat, Vangelis Th. Paschos
1999 J jnl
The probabilistic longest path problem.
Networks
Cécile Murat, Vangelis Th. Paschos
1997 J jnl
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts.
Ann. Oper. Res.
Virginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Th. Paschos