A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. - Virginie Gabrel; Alain Moulet; Cécile Murat; Vangelis Th. Paschos (Ann. Oper. Res., 1997)

Exact solution of multicommodity network optimization problems with general step cost functions. - Virginie Gabrel; Arnaud Knippel; Michel Minoux (Oper. Res. Lett., 1999)

Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. - Virginie Gabrel; Daniel Vanderpooten (Eur. J. Oper. Res., 2002)

A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. - Virginie Gabrel; Michel Minoux (Oper. Res. Lett., 2002)

A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. - Virginie Gabrel; Arnaud Knippel; Michel Minoux (J. Heuristics, 2003)

Strengthened 0-1 linear formulation for the daily satellite mission planning. - Virginie Gabrel (J. Comb. Optim., 2006)

Best and Worst Optimum for Linear Programs with Interval Right Hand Sides. - Virginie Gabrel; Cécile Murat; Nabila Remli (MCO, 2008)

Recourse problem of the 2-stage robust location transportation problem. - Virginie Gabrel; Cécile Murat; Nabila Remli; Mathieu Lacroix 001 (Electron. Notes Discret. Math., 2010)

Linear programming with interval right hand sides. - Virginie Gabrel; Cécile Murat; Nabila Remli (Int. Trans. Oper. Res., 2010)

Robustness and duality in linear programming. - Virginie Gabrel; Céline Murat (J. Oper. Res. Soc., 2010)

Multilayer Survivable Optical Network Design. - Sylvie Borne; Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak (INOC, 2011)

A new 0-1 linear program for QoS and transactional-aware web service composition. - Virginie Gabrel; Maude Manouvrier; Imen Megdiche; Cécile Murat (ISCC, 2012)

New models for the robust shortest path problem: complexity, resolution and generalization. - Virginie Gabrel; Cécile Murat; Lei Wu 005 (Ann. Oper. Res., 2013)

Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming. - Virginie Gabrel; Maude Manouvrier; Cécile Murat (ICSOC, 2014)

Robust location transportation problems under uncertain demands. - Virginie Gabrel; Mathieu Lacroix 001; Cécile Murat; Nabila Remli (Discret. Appl. Math., 2014)

Recent advances in robust optimization: An overview. - Virginie Gabrel; Cécile Murat; Aurélie Thiele (Eur. J. Oper. Res., 2014)

Web services composition: Complexity and models. - Virginie Gabrel; Maude Manouvrier; Cécile Murat (Discret. Appl. Math., 2015)

MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. - Filippo Focacci; Fabio Furini; Virginie Gabrel; Daniel Godard; Xueying Shen (ISCO, 2016)

Lower Bounding Techniques for DSATUR-based Branch and Bound. - Fabio Furini; Virginie Gabrel; Ian-Christopher Ternier (Electron. Notes Discret. Math., 2016)

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. - I. Diarrassouba; Virginie Gabrel; Ali Ridha Mahjoub; Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2016)

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. - Fabio Furini; Virginie Gabrel; Ian-Christopher Ternier (Networks, 2017)

Portfolio optimization with pw-robustness. - Virginie Gabrel; Cécile Murat; Aurélie Thiele (EURO J. Comput. Optim., 2018)

QoS-aware automatic syntactic service composition problem: Complexity and resolution. - Virginie Gabrel; Maude Manouvrier; Kamil Moreau; Cécile Murat (Future Gener. Comput. Syst., 2018)

A robust p-Center problem under pressure to locate shelters in wildfire context. - Marc Demange; Virginie Gabrel; Marcel Adonis Haddad; Cécile Murat (EURO J. Comput. Optim., 2020)

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. - Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (Soft Comput., 2020)