Frédéric Meunier

Frédéric Meunier

Auto-generated profile, based on publicly available information

Frédéric Meunier

CERMICS, ENPC, Institut Polytechnique de Paris

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2011 in RAIRO - Operations Research
Verified
Journal Article
Closed access
PDF file
MBMike Benchimol
Mike Benchimol
PBPascal Benchimol
Pascal Benchimol
BCBenoît Chappert
Benoît Chappert
ATArnaud de la Taille
Arnaud de la Taille
FLFabien Laroche
Fabien Laroche
LRLudovic Robinet
Ludovic Robinet
This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount x v of a commodity and wishes to have an amount equal to y v (we assume that and all quantities are assumed to be integers); given a vehicle of capacity C, find a minimal route that balances all vertices, that is, that allows to have an amount y v of the commodity on each vertex v. This paper presents among other things complexity results, lower bounds, approximation algorithms, and a polynomial algorithm when G is a tree.

13 October 2018 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
GLGilbert Laporte
Gilbert Laporte
FMFrédéric Meunier
Frédéric Meunier
RCRoberto Wolfler Calvo
Roberto Wolfler Calvo

24 November 2015 in 4OR
Verified
Journal Article
Closed access
PDF file
GLGilbert Laporte
Gilbert Laporte
FMFrédéric Meunier
Frédéric Meunier
RCRoberto Wolfler Calvo
Roberto Wolfler Calvo

25 January 2019 in Bulletin of the American Mathematical Society
Verified
Journal Article
Open access
PDF file
JLJesús De Loera
Jesús De Loera
XGXavier Goaoc
Xavier Goaoc
FMFrédéric Meunier
Frédéric Meunier
NMNabil Mustafa
Nabil Mustafa
We discuss five fundamental results of discrete mathematics: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carathéodory, Helly, and Tverberg from combinatorial geometry. We explore their connections and emphasize their broad impact in application areas such as data science, game theory, graph theory, mathematical optimization, computational geometry, etc.

7 October 2019 in Israel Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
FMFrédéric Meunier
Frédéric Meunier
SZShira Zerbib
Shira Zerbib

7 July 2009 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
SGStéphane Gaubert
Stéphane Gaubert
FMFrédéric Meunier
Frédéric Meunier