According to our database1, Virginie Gabrel authored at least 23 papers between 1997 and 2018.
Legend:Book In proceedings Article PhD thesis Other
QoS-aware automatic syntactic service composition problem: Complexity and resolution.
Future Generation Comp. Syst., 2018
Portfolio optimization with pw-robustness.
EURO J. Computational Optimization, 2018
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem.
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem.
Lower Bounding Techniques for DSATUR-based Branch and Bound.
Electronic Notes in Discrete Mathematics, 2016
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
Web services composition: Complexity and models.
Discrete Applied Mathematics, 2015
Recent advances in robust optimization: An overview.
European Journal of Operational Research, 2014
Robust location transportation problems under uncertain demands.
Discrete Applied Mathematics, 2014
Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming.
Proceedings of the Service-Oriented Computing - 12th International Conference, 2014
New models for the robust shortest path problem: complexity, resolution and generalization.
Annals OR, 2013
A new 0-1 linear program for QoS and transactional-aware web service composition.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012
Multilayer Survivable Optical Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011
Robustness and duality in linear programming.
Linear programming with interval right hand sides.
Recourse problem of the 2-stage robust location transportation problem.
Electronic Notes in Discrete Mathematics, 2010
Best and Worst Optimum for Linear Programs with Interval Right Hand Sides.
Proceedings of the Modelling, 2008
Strengthened 0-1 linear formulation for the daily satellite mission planning.
J. Comb. Optim., 2006
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem.
J. Heuristics, 2003
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems.
Oper. Res. Lett., 2002
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite.
European Journal of Operational Research, 2002
Exact solution of multicommodity network optimization problems with general step cost functions.
Oper. Res. Lett., 1999
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts.
Annals OR, 1997