Bertrand Estellon

According to our database1, Bertrand Estellon authored at least 15 papers between 2006 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Packing and Covering with Balls on Busemann Surfaces.
Discret. Comput. Geom., 2017

2013
Car sequencing is NP-hard: a short proof.
J. Oper. Res. Soc., 2013

2012
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.
Algorithmica, 2012

2011
Randomized Local Search for Real-Life Inventory Routing.
Transp. Sci., 2011

LocalSolver 1.x: a black-box local-search solver for 0-1 programming.
4OR, 2011

2009
High-Performance Local Search for Task Scheduling with Human Resource Allocation.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

High-Performance Local Search for Solving Real-Life Inventory Routing Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

2008
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.
Theor. Comput. Sci., 2008

Two local search approaches for solving real-life car sequencing problems.
Eur. J. Oper. Res., 2008

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.
Electron. Notes Discret. Math., 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Covering Planar Graphs with a Fixed Number of Balls.
Discret. Comput. Geom., 2007

Packing and Covering <i>delta</i> -Hyperbolic Spaces by Balls.
Proceedings of the Approximation, 2007

2006
Large neighborhood improvements for solving car sequencing problems.
RAIRO Oper. Res., 2006

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.
Algorithmica, 2006


  Loading...