Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Cecile Murat

Email : Cecile.Murat@lamsade.dauphine.fr

Tel : 0144054483
Bureau : P630
Pole : Optimisation combinatoire algorithmique
Status : Maitre de conférence
Domaines de Recherche : Optimisation Combinatoire probabiliste, robustesse


Encadrement de these de doctorat :


  • Marcel Haddad : Optimisation Combinatoire Probabiliste Appliquées à la gestion des feux de foret ( Début : 2016-10-01)
voir toutes les theses

Publications Dblp


Publications DFIS


Publications HAL


20 QoS-aware Automatic Syntactic Service Composition problem: complexity and resolution (, , and ), . [bibtex] [pdf]

19 Web services composition: Complexity and models (, and ), In Discrete Applied Mathematics, Elsevier, volume 196, . [bibtex] [pdf] [doi]

18 Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming (, and ), In 12th International Conference on Service-Oriented Computing , ICSOC 2014, . [bibtex] [pdf] [doi]

17 Recent advances in robust optimization: An overview (, and ), In European Journal of Operational Research, volume 235, . [bibtex] [pdf] [doi]

16 Robust location transportation problems under uncertain demands (, , and ), In Discrete Applied Mathematics, Elsevier, volume 146, . [bibtex] [pdf] [doi]

15 A new linear program for QoS-aware web service composition based on complex workflow (, and ), . [bibtex] [pdf]

14 New models for the robust shortest path problem: complexity, resolution and generalization (, and ), In Annals of Operations Research, volume 207, . [bibtex] [pdf] [doi]

13 An emergency management model for a wireless sensor network problem (, and ), . [bibtex] [pdf]

12 A new 0–1 linear program for QoS and transactional-aware web service composition (, , and ), In 2012 IEEE Symposium on Computers and Communications (ISCC), . [bibtex] [pdf] [doi]

11 On the probabilistic min spanning tree Problem (, and ), In Journal of Mathematical Modelling and Algorithms, Springer Verlag, volume 11, . [bibtex] [pdf] [doi]

10 On the PROBABILISTIC MIN SPANNING TREE problem (, and ), . [bibtex] [pdf]

9 Robust shortest path problems ( and ), . [bibtex] [pdf]

8 Probabilistic graph-coloring in bipartite and split graphs (Exented version of cahier du LAMSADE 218) (, , , and ), . [bibtex] [pdf]

7 Linear Programming with interval right handsides (, and ), . [bibtex] [pdf]

6 Probabilistic graph-coloring in bipartite and split graphs (, , , and ), . [bibtex] [pdf]

5 Linear Programming with interval right handsides (, and ), . [bibtex] [pdf]

4 Flows ( and ), . [bibtex] [pdf]

3 What about future? Robustness under vertex-uncertainty in graph-problems ( and ), . [bibtex] [pdf]

2 What about future? Robustness under vertex-uncertainty in graph-problems ( and ), . [bibtex] [pdf]

1 Probabilistic coloring of bipartite and split graphs (, , and ), . [bibtex] [pdf]