default search action
Guillaume Massonnet
Person information
- affiliation: Université de Nantes, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Benoit Loger
, Alexandre Dolgui
Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization. INFORMS J. Comput. 36(3): 900-917 (2024) - 2022
- [j4]François Larroche, Odile Bellenguez
Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups. Int. J. Prod. Res. 60(21): 6573-6596 (2022) - 2021
- [c5]Pooya Hedayatinia
Put Option Contracts in Newsvendor Model with Bankruptcy Risk. APMS (3) 2021: 167-174 - [c4]Benoit Loger, Alexandre Dolgui, Fabien Lehuédé, Guillaume Massonnet:
A Robust Data Driven Approach to Supply Planning. APMS (4) 2021: 169-178 - [c3]François Larroche, Odile Bellenguez
Three-Phase Method for the Capacitated Lot-Sizing Problem with Sequence Dependent Setups. APMS (2) 2021: 694-702
2010 – 2019
- 2017
- [j3]Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. Math. Oper. Res. 42(3): 854-875 (2017) - 2016
- [j2]Jean-Philippe Gayon
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales. Eur. J. Oper. Res. 250(1): 155-163 (2016) - 2015
- [c2]Nicolas Gast, Guillaume Massonnet, Daniël Reijsbergen, Mirco Tribastone:
Probabilistic Forecasts of Bike-Sharing Systems for Journey Planning. CIKM 2015: 703-712 - 2014
- [j1]Guillaume Massonnet, Jean-Philippe Gayon, Christophe Rapine
Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand. Eur. J. Oper. Res. 234(3): 641-649 (2014) - 2013
- [b1]Guillaume Massonnet:
Algorithmes d'approximation pour la gestion de stock. (Approximation algorithms for inventory control models). University of Grenoble, France, 2013 - 2011
- [c1]Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon:
A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problem. SODA 2011: 67-79
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-08-03 20:09 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: