Cécile Murat - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2024

Approximating the probabilistic p-Center problem under pressureMarc Demange, Marcel Adonis Haddad, Cécile Murat. jco, 48(1):9, August 2024. [doi]

2020

p-Center problem under pressure to locate shelters in wildfire contextMarc Demange, Virginie Gabrel, Marcel Adonis Haddad, Cécile Murat. ejco, 8(2):103-139, 2020. [doi]

2018

2015

Web services composition: Complexity and modelsVirginie Gabrel, Maude Manouvrier, Cécile Murat. DAM, 196:100-114, 2015. [doi]

2014

Recent advances in robust optimization: An overviewVirginie Gabrel, Cécile Murat, Aurélie Thiele. eor, 235(3):471-483, 2014. [doi]

Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear ProgrammingVirginie Gabrel, Maude Manouvrier, Cécile Murat. icsoc 2014: 108-122 [doi]

Robust location transportation problems under uncertain demandsVirginie Gabrel, Mathieu Lacroix, Cécile Murat, Nabila Remli. DAM, 164:100-111, 2014. [doi]

2013

The Probabilistic Min Dominating Set ProblemNicolas Boria, Cécile Murat, Vangelis Th. Paschos. csr 2013: 298-309 [doi]

New models for the robust shortest path problem: complexity, resolution and generalizationVirginie Gabrel, Cécile Murat, Lei Wu. anor, 207(1):97-120, 2013. [doi]

2012

On the probabilistic min spanning tree ProblemNicolas Boria, Cécile Murat, Vangelis Th. Paschos. jmma, 11(1):45-76, 2012. [doi]

A new 0-1 linear program for QoS and transactional-aware web service compositionVirginie Gabrel, Maude Manouvrier, Imen Megdiche, Cécile Murat. ISCC 2012: 845-850 [doi]

2010

Linear programming with interval right hand sidesVirginie Gabrel, Cécile Murat, Nabila Remli. itor, 17(3):397-408, 2010. [doi]

Recourse problem of the 2-stage robust location transportation problemVirginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix. endm, 36:167-174, 2010. [doi]

Probabilistic optimization in graph-problemsCécile Murat, Vangelis Th. Paschos. aor, 5(1):49-64, 2010. [doi]

2009

Probabilistic graph-coloring in bipartite and split graphsNicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos. jco, 17(3):274-311, 2009. [doi]

2008

Best and Worst Optimum for Linear Programs with Interval Right Hand SidesVirginie Gabrel, Cécile Murat, Nabila Remli. FMCO 2008: 126-134 [doi]

Vertex-Uncertainty in Graph-ProblemsCécile Murat, Vangelis Th. Paschos. cocoa 2008: 139-148 [doi]

2006

On the probabilistic minimum coloring and minimum ::::k::::-coloringCécile Murat, Vangelis Th. Paschos. DAM, 154(3):564-586, 2006. [doi]

2005

Probabilistic Coloring of Bipartite and Split GraphsFederico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos. iccsa 2005: 202-211 [doi]

2003

The Probabilistic Minimum Coloring ProblemCécile Murat, Vangelis Th. Paschos. criwg 2003: 346-357 [doi]

2002

A priori optimization for the probabilistic maximum independent set problemCécile Murat, Vangelis Th. Paschos. TCS, 270(1-2):561-590, 2002. [doi]

1999

The probabilistic longest path problemCécile Murat, Vangelis Th. Paschos. networks, 33(3):207-219, 1999. [doi]

1997

A new single model and derived algorithms for the satellite shot planning problem using graph theory conceptsVirginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Th. Paschos. anor, 69:115-134, 1997. [doi]

Sign in or sign up to see more results.

runs on WebDSL