Guillaume Sagnol

Orcid: 0000-0001-6910-8907

According to our database1, Guillaume Sagnol authored at least 25 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation.
J. Mach. Learn. Res., 2023

Surgery Scheduling in Flexible Operating Rooms by using a Convex Surrogate Model of Second-Stage Costs.
CoRR, 2023

Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
PICOS: A Python interface to conic optimization solvers.
J. Open Source Softw., 2022

Competitive Strategies for Symmetric Rendezvous on the Line.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Improved Bounds for Stochastic Extensible Bin Packing Under Distributional Assumptions.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021
Restricted Adaptivity in Stochastic Scheduling.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Stochastic Extensible Bin Packing.
CoRR, 2020

2018
The cone of flow matrices: Approximation hierarchies and applications.
Networks, 2018

Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations.
Eur. J. Oper. Res., 2018

Approximation Hierarchies for the cone of flow matrices.
Electron. Notes Discret. Math., 2018

An algorithm based on semidefinite programming for finding minimax optimal designs.
Comput. Stat. Data Anal., 2018

The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017
Optimal duty rostering for toll enforcement inspectors.
Ann. Oper. Res., 2017

2016
An Extended Network Interdiction Problem for Optimal Toll Control.
Electron. Notes Discret. Math., 2016

2015
Network spot-checking games: Theory and application to toll enforcing in transportation networks.
Networks, 2015

2013
Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach.
Electron. Notes Discret. Math., 2013

Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs.
Discret. Appl. Math., 2013

2012
A Case Study on Optimizing Toll Enforcements on Motorways.
Proceedings of the 3rd Student Conference on Operational Research, 2012

A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks.
Proceedings of the Game Theory for Networks, 2012

2011
An IP approach to toll enforcement optimization on German motorways.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
Submodularity and Randomized rounding techniques for Optimal Experimental Design.
Electron. Notes Discret. Math., 2010

Optimal monitoring in large networks by Successive c-optimal Designs.
Proceedings of the 22nd International Teletraffic Congress, 2010

Successive c-optimal designs: a scalable technique to optimize the measurements on large networks.
Proceedings of the SIGMETRICS 2010, 2010


  Loading...