Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Virginie Gabrel

Email : Virginie.Gabrel@lamsade.dauphine.fr

Tel : 0144054139
Bureau : P630
Site Personnel: http://www.lamsade.dauphine.fr/~gabrel/
Pole : Optimisation combinatoire algorithmique
Status : Maitre de conférence
Domaines de Recherche : Modélisation, Optimisation en programmation mathématique et théorie de graphes, Robustesse

Biographie : J'ai obtenu mon Doctorat en Informatique de l'Universite Paris Dauphine en 1994, ce dernier ayant ete finance par la Direction Generale de l'Armement sur des problemes de planification de prises de vue par satellites. En 2005, j'ai soutenu mon Habilitation a Diriger des Recherches de l'Universite Paris Dauphine. De 1996 a 2002, j'ai ete Maitre de Conferences en Informatique a l'Universite Paris 13 et, depuis 2002, je suis Maitre de Conferences en Informatique a l'Universite Paris Dauphine. Je suis rattachee au LAMSADE (dont j'ai ete directrice adjointe de debut 2012 a fin 2014). J'ai publie environ 40 papiers dans des journaux et conferences internationaux. Mes recherches concernent la modelisation en Recherche Operationnelle, la resolution de problemes de grande taille (avec des techniques de decomposition), les applications industrielles (planification de missions spatiales, optimisation de reseaux de telecommunication, composition automatique de Services Web...) et la robustesse en programmation mathematique.


Encadrement de these de doctorat :


  • Ian-christopher Ternier : Coloration de graphes par branch-and-price ( Début : 2014-10-01)
  • Xueying Shen : Modèle d'optimisation robuste en environnements dynamiques appliqués à la production et à la logistique ( Début : 2015-01-01)
voir toutes les theses

Publications Dblp


Publications DFIS


Publications HAL


18 An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem (, and ), In Networks, volume 69, . [bibtex] [pdf] [doi]

17 MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover (, , , and ), In 4th International Symposium, ISCO 2016, . [bibtex] [pdf] [doi]

16 Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem (, , , and ), In Networks, Wiley, volume 67, . [bibtex] [pdf] [doi]

15 Lower Bounding Techniques for DSATUR-based Branch and Bound (, and ), In Electronic Notes in Discrete Mathematics, volume 52, . [bibtex] [pdf] [doi]

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

13 Mathematical models for real-world production planning problems with sequence-dependent set-up costs (, , , and ), In ROADEF 2015, . [bibtex] [pdf]

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

11 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]

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

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

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

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

6 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]

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

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

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

2 An extensive comparison of 0-1 linear programs for the daily satellite mission planning (), . [bibtex] [pdf]

1 Dantzig-Wolfe decomposition for linearly constrained stable set problem (), . [bibtex] [pdf]