default search action
Cécile Murat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Marc Demange
, Marcel Adonis Haddad, Cécile Murat:
Approximating the probabilistic p-Center problem under pressure. J. Comb. Optim. 48(1): 9 (2024) - 2020
- [j17]Marc Demange
A robust p-Center problem under pressure to locate shelters in wildfire context. EURO J. Comput. Optim. 8(2): 103-139 (2020) - [i1]Marc Demange, Marcel Adonis Haddad, Cécile Murat:
Hardness and approximation of the Probabilistic p-Center problem under Pressure. CoRR abs/2009.08751 (2020)
2010 – 2019
- 2018
- [j16]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The probabilistic minimum dominating set problem. Discret. Appl. Math. 234: 93-113 (2018) - [j15]Virginie Gabrel, Cécile Murat, Aurélie Thiele
Portfolio optimization with pw-robustness. EURO J. Comput. Optim. 6(3): 267-290 (2018) - [j14]Virginie Gabrel, Maude Manouvrier
QoS-aware automatic syntactic service composition problem: Complexity and resolution. Future Gener. Comput. Syst. 80: 311-321 (2018) - [c9]Marc Demange, Marcel Adonis Haddad, Cécile Murat:
The probabilistic k-center problem. RSFF 2018: 62-74 - 2015
- [j13]Virginie Gabrel, Maude Manouvrier
Web services composition: Complexity and models. Discret. Appl. Math. 196: 100-114 (2015) - 2014
- [j12]Virginie Gabrel, Mathieu Lacroix
Robust location transportation problems under uncertain demands. Discret. Appl. Math. 164: 100-111 (2014) - [j11]Virginie Gabrel, Cécile Murat, Aurélie Thiele:
Recent advances in robust optimization: An overview. Eur. J. Oper. Res. 235(3): 471-483 (2014) - [c8]Virginie Gabrel, Maude Manouvrier
Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming. ICSOC 2014: 108-122 - 2013
- [j10]Virginie Gabrel, Cécile Murat, Lei Wu
New models for the robust shortest path problem: complexity, resolution and generalization. Ann. Oper. Res. 207(1): 97-120 (2013) - [c7]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Min Dominating Set Problem. CSR 2013: 298-309 - 2012
- [j9]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms 11(1): 45-76 (2012) - [c6]Virginie Gabrel, Maude Manouvrier, Imen Megdiche
A new 0-1 linear program for QoS and transactional-aware web service composition. ISCC 2012: 845-850 - 2010
- [j8]Cécile Murat, Vangelis Th. Paschos:
Probabilistic optimization in graph-problems. Algorithmic Oper. Res. 5(1): 49-64 (2010) - [j7]Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix
Recourse problem of the 2-stage robust location transportation problem. Electron. Notes Discret. Math. 36: 167-174 (2010) - [j6]Virginie Gabrel, Cécile Murat, Nabila Remli:
Linear programming with interval right hand sides. Int. Trans. Oper. Res. 17(3): 397-408 (2010) - [c5]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the Probabilistic min spanning tree problem. IMCSIT 2010: 893-900
2000 – 2009
- 2009
- [j5]Nicolas Bourgeois, Federico Della Croce
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17(3): 274-311 (2009) - 2008
- [c4]Cécile Murat, Vangelis Th. Paschos:
Vertex-Uncertainty in Graph-Problems. COCOA 2008: 139-148 - [c3]Virginie Gabrel, Cécile Murat, Nabila Remli:
Best and Worst Optimum for Linear Programs with Interval Right Hand Sides. MCO 2008: 126-134 - 2006
- [j4]Cécile Murat, Vangelis Th. Paschos:
On the probabilistic minimum coloring and minimum k-coloring. Discret. Appl. Math. 154(3): 564-586 (2006) - 2005
- [c2]Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) 2005: 202-211 - 2003
- [c1]Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Minimum Coloring Problem. WG 2003: 346-357 - 2002
- [j3]Cécile Murat, Vangelis Th. Paschos:
A priori optimization for the probabilistic maximum independent set problem. Theor. Comput. Sci. 270(1-2): 561-590 (2002)
1990 – 1999
- 1999
- [j2]Cécile Murat, Vangelis Th. Paschos:
The probabilistic longest path problem. Networks 33(3): 207-219 (1999) - 1997
- [j1]Virginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Th. Paschos:
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. Ann. Oper. Res. 69: 115-134 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: