Bertrand Estellon

Guyslain Naves

Discret. Comput. Geom., 2017

2013

Car sequencing is NP-hard: a short proof.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2013

2012

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Randomized Local Search for Real-Life Inventory Routing.

[BibT_eX]

[DOI]

Transp. Sci., 2011

LocalSolver 1.x: a black-box local-search solver for 0-1 programming.

[BibT_eX]

[DOI]

4OR, 2011

2009

High-Performance Local Search for Task Scheduling with Human Resource Allocation.

[BibT_eX]

[DOI]

Karim Nouioua

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

High-Performance Local Search for Solving Real-Life Inventory Routing Problems.

[BibT_eX]

[DOI]

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009

2008

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.

[BibT_eX]

[DOI]

Yann Vaxès

Theor. Comput. Sci., 2008

Two local search approaches for solving real-life car sequencing problems.

[BibT_eX]

[DOI]

Karim Nouioua

Eur. J. Oper. Res., 2008

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Covering Planar Graphs with a Fixed Number of Balls.

[BibT_eX]

[DOI]

Yann Vaxès

Discret. Comput. Geom., 2007

Packing and Covering <i>delta</i> -Hyperbolic Spaces by Balls.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

Large neighborhood improvements for solving car sequencing problems.

[BibT_eX]

[DOI]