A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem. - Gautier Stauffer; Guillaume Massonnet; Christophe Rapine; Jean-Philippe Gayon (SODA, 2011)

Algorithmes d'approximation pour la gestion de stock. (Approximation algorithms for inventory control models). - Guillaume Massonnet (2013)

Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand. - Guillaume Massonnet; Jean-Philippe Gayon; Christophe Rapine (Eur. J. Oper. Res., 2014)

Probabilistic Forecasts of Bike-Sharing Systems for Journey Planning. - Nicolas Gast; Guillaume Massonnet; Daniël Reijsbergen; Mirco Tribastone (CIKM, 2015)

Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. - Jean-Philippe Gayon; Guillaume Massonnet; Christophe Rapine; Gautier Stauffer (Eur. J. Oper. Res., 2016)

Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. - Jean-Philippe Gayon; Guillaume Massonnet; Christophe Rapine; Gautier Stauffer (Math. Oper. Res., 2017)

Put Option Contracts in Newsvendor Model with Bankruptcy Risk. - Pooya Hedayatinia; David Lemoine; Guillaume Massonnet; Jean-Laurent Viviani (APMS (3), 2021)

Three-Phase Method for the Capacitated Lot-Sizing Problem with Sequence Dependent Setups. - François Larroche; Odile Bellenguez; Guillaume Massonnet (APMS (2), 2021)

A Robust Data Driven Approach to Supply Planning. - Benoit Loger; Alexandre Dolgui; Fabien Lehuédé; Guillaume Massonnet (APMS (4), 2021)

Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups. - François Larroche; Odile Bellenguez; Guillaume Massonnet (Int. J. Prod. Res., 2022)

Reinforcement Learning methods for preventive maintenance and machine replacement problem with second-hand equipment. - Chen Xiong; Guillaume Massonnet; Simon Thevenin (CASE, 2024)

Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization. - Benoit Loger; Alexandre Dolgui; Fabien Lehuédé; Guillaume Massonnet (INFORMS J. Comput., 2024)

Tabu search for a multi-mode RCPSP with generalized precedence and sequence-dependent setup time. - Baptistin Carvin; Odile Bellenguez; Guillaume Massonnet (Comput. Ind. Eng., 2025)

2-approximation algorithms for two variants of the static stochastic joint replenishment problem. - Guillaume Massonnet; Gautier Stauffer (Oper. Res. Lett., 2025)