default search action
Guillaume Sagnol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j13]Mohammed Majthoub Almoghrabi, Guillaume Sagnol:
Surgery scheduling in flexible operating rooms by using a convex surrogate model of second-stage costs. Eur. J. Oper. Res. 321(1): 23-40 (2025) - 2023
- [j12]Guillaume Sagnol, Luc Pronzato:
Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation. J. Mach. Learn. Res. 24: 307:1-307:32 (2023) - [c11]Sven Jäger
, Guillaume Sagnol
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling. IPCO 2023: 246-260 - [c10]Guillaume Sagnol
Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing. IWOCA 2023: 343-355 - [i5]Guillaume Sagnol:
Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing. CoRR abs/2304.02498 (2023) - [i4]Mohammed Majthoub Almoghrabi, Guillaume Sagnol:
Surgery Scheduling in Flexible Operating Rooms by using a Convex Surrogate Model of Second-Stage Costs. CoRR abs/2304.13670 (2023) - 2022
- [j11]Guillaume Sagnol
PICOS: A Python interface to conic optimization solvers. J. Open Source Softw. 7(69): 3915 (2022) - [c9]Guillaume Sagnol
Improved Bounds for Stochastic Extensible Bin Packing Under Distributional Assumptions. ISCO 2022: 228-241 - [c8]Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran:
Competitive Strategies for Symmetric Rendezvous on the Line. SODA 2022: 329-347 - [i3]Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling. CoRR abs/2211.02044 (2022) - 2021
- [c7]Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt:
Restricted Adaptivity in Stochastic Scheduling. ESA 2021: 79:1-79:14 - [i2]Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt:
Restricted Adaptivity in Stochastic Scheduling. CoRR abs/2106.15393 (2021) - 2020
- [i1]Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt:
Stochastic Extensible Bin Packing. CoRR abs/2002.00060 (2020)
2010 – 2019
- 2018
- [j10]Belmiro P. M. Duarte
An algorithm based on semidefinite programming for finding minimax optimal designs. Comput. Stat. Data Anal. 119: 99-117 (2018) - [j9]Guillaume Sagnol, Marco Blanco, Thibaut Sauvage:
Approximation Hierarchies for the cone of flow matrices. Electron. Notes Discret. Math. 64: 275-284 (2018) - [j8]Guillaume Sagnol, Christoph Barner, Ralf Borndörfer, Mickaël Grima, Matthes Seeling, Claudia Spies, Klaus Wernecke:
Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations. Eur. J. Oper. Res. 271(2): 420-435 (2018) - [j7]Guillaume Sagnol
The cone of flow matrices: Approximation hierarchies and applications. Networks 72(1): 128-150 (2018) - [c6]Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Alexander Tesch:
The Price of Fixed Assignments in Stochastic Extensible Bin Packing. WAOA 2018: 327-347 - 2017
- [j6]Ralf Borndörfer, Guillaume Sagnol, Thomas Schlechte, Elmar Swarat:
Optimal duty rostering for toll enforcement inspectors. Ann. Oper. Res. 252(2): 383-406 (2017) - 2016
- [j5]Ralf Borndörfer, Guillaume Sagnol, Stephan Schwartz:
An Extended Network Interdiction Problem for Optimal Toll Control. Electron. Notes Discret. Math. 52: 301-308 (2016) - 2015
- [j4]Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat:
Network spot-checking games: Theory and application to toll enforcing in transportation networks. Networks 65(4): 312-328 (2015) - 2013
- [j3]Guillaume Sagnol:
Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs. Discret. Appl. Math. 161(1-2): 258-276 (2013) - [j2]Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat:
Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach. Electron. Notes Discret. Math. 41: 253-260 (2013) - 2012
- [c5]Ralf Borndörfer, Bertrand Omont, Guillaume Sagnol, Elmar Swarat:
A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks. GAMENETS 2012: 224-235 - [c4]Ralf Borndörfer, Guillaume Sagnol, Elmar Swarat:
A Case Study on Optimizing Toll Enforcements on Motorways. SCOR 2012: 1-10 - 2011
- [c3]Ralf Borndörfer, Guillaume Sagnol, Elmar Swarat:
An IP approach to toll enforcement optimization on German motorways. OR 2011: 317-322 - 2010
- [j1]Mustapha Bouhtou, Stéphane Gaubert, Guillaume Sagnol:
Submodularity and Randomized rounding techniques for Optimal Experimental Design. Electron. Notes Discret. Math. 36: 679-686 (2010) - [c2]Guillaume Sagnol, Mustapha Bouhtou, Stéphane Gaubert:
Successive c-optimal designs: a scalable technique to optimize the measurements on large networks. SIGMETRICS 2010: 347-348 - [c1]Guillaume Sagnol, Stéphane Gaubert, Mustapha Bouhtou:
Optimal monitoring in large networks by Successive c-optimal Designs. ITC 2010: 1-8
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-12-09 22:10 CET 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: