default search action
Virginie Gabrel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j20]Marc Demange
, Virginie Gabrel
A robust p-Center problem under pressure to locate shelters in wildfire context. EURO J. Comput. Optim. 8(2): 103-139 (2020) - [j19]Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput. 24(23): 17957-17968 (2020)
2010 – 2019
- 2018
- [j18]Virginie Gabrel, Cécile Murat, Aurélie Thiele
Portfolio optimization with pw-robustness. EURO J. Comput. Optim. 6(3): 267-290 (2018) - [j17]Virginie Gabrel, Maude Manouvrier
QoS-aware automatic syntactic service composition problem: Complexity and resolution. Future Gener. Comput. Syst. 80: 311-321 (2018) - 2017
- [j16]Fabio Furini
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. Networks 69(1): 124-141 (2017) - 2016
- [j15]Fabio Furini
Lower Bounding Techniques for DSATUR-based Branch and Bound. Electron. Notes Discret. Math. 52: 149-156 (2016) - [j14]I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67(2): 148-169 (2016) - [c5]Filippo Focacci, Fabio Furini
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. ISCO 2016: 123-134 - 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) - [c4]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) - 2012
- [c3]Virginie Gabrel, Maude Manouvrier, Imen Megdiche
A new 0-1 linear program for QoS and transactional-aware web service composition. ISCC 2012: 845-850 - 2011
- [c2]Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak:
Multilayer Survivable Optical Network Design. INOC 2011: 170-175 - 2010
- [j9]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) - [j8]Virginie Gabrel, Cécile Murat, Nabila Remli:
Linear programming with interval right hand sides. Int. Trans. Oper. Res. 17(3): 397-408 (2010) - [j7]Virginie Gabrel, Céline Murat:
Robustness and duality in linear programming. J. Oper. Res. Soc. 61(8): 1288-1296 (2010)
2000 – 2009
- 2008
- [c1]Virginie Gabrel, Cécile Murat, Nabila Remli:
Best and Worst Optimum for Linear Programs with Interval Right Hand Sides. MCO 2008: 126-134 - 2006
- [j6]Virginie Gabrel:
Strengthened 0-1 linear formulation for the daily satellite mission planning. J. Comb. Optim. 11(3): 341-346 (2006) - 2003
- [j5]Virginie Gabrel, Arnaud Knippel, Michel Minoux:
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. J. Heuristics 9(5): 429-445 (2003) - 2002
- [j4]Virginie Gabrel, Daniel Vanderpooten
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. Eur. J. Oper. Res. 139(3): 533-542 (2002) - [j3]Virginie Gabrel, Michel Minoux:
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Oper. Res. Lett. 30(4): 252-264 (2002)
1990 – 1999
- 1999
- [j2]Virginie Gabrel, Arnaud Knippel, Michel Minoux:
Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25(1): 15-23 (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-10-07 21:20 CEST 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: