Éric D. Taillard

According to our database1, Éric D. Taillard authored at least 31 papers between 1991 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A linearithmic heuristic for the travelling salesman problem.
Eur. J. Oper. Res., 2022

Unsupervised Machine Learning for the Quadratic Assignment Problem.
Proceedings of the Metaheuristics - 14th International Conference, 2022

2019
POPMUSIC for the travelling salesman problem.
Eur. J. Oper. Res., 2019

2018
POPMUSIC.
Proceedings of the Handbook of Heuristics., 2018

2013
POPMUSIC for the world location-routing problem.
EURO J. Transp. Logist., 2013

2012
Parallelization Strategies for Hybrid Metaheuristics Using a Single GPU and Multi-core Resources.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

2009
POPMUSIC for a real-world large-scale vehicle routing problem with time windows.
J. Oper. Res. Soc., 2009

Feature cluster INCOM 2006 Metaheuristics: Transportation and logistics.
Eur. J. Oper. Res., 2009

POPMUSIC for the point feature label placement problem.
Eur. J. Oper. Res., 2009

Towards an Automated Label Placement Service.
Proceedings of the Geospatial Free and Open Source Software in the 21st Century, 2009

2008
Few statistical tests for proportions comparison.
Eur. J. Oper. Res., 2008

Feature cluster on papers presented at the FRANCORO IV conference.
Eur. J. Oper. Res., 2008

2007
Analysis and test of efficient methods for building recursive deterministic perceptron neural networks.
Neural Networks, 2007

2006
The Generalisation of the Recursive Deterministic Perceptron.
Proceedings of the International Joint Conference on Neural Networks, 2006

2005
Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods.
Ann. Oper. Res., 2005

2003
Heuristic Methods for Large Centroid Clustering Problems.
J. Heuristics, 2003

2001
Adaptive memory programming: A unified view of metaheuristics.
Eur. J. Oper. Res., 2001

2000
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.
Oper. Res., 2000

1999
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching.
Transp. Sci., 1999

A heuristic column generation method for the heterogeneous fleet VRP.
RAIRO Oper. Res., 1999

Ant colonies for the quadratic assignment problem.
J. Oper. Res. Soc., 1999

A tabu search heuristic for the heterogeneous fleet vehicle routing problem.
Comput. Oper. Res., 1999

1998
Heuristic solution of the multisource Weber problem as a p-median problem.
Oper. Res. Lett., 1998

1997
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.
Transp. Sci., 1997

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.
Comput. Oper. Res., 1997

1995
Probabilistic diversification and intensification in local search for vehicle routing.
J. Heuristics, 1995

1994
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem.
INFORMS J. Comput., 1994

1993
Parallel iterative search methods for vehicle routing problems.
Networks, 1993

Solving real-life vehicle routing problems efficiently using tabu search.
Ann. Oper. Res., 1993

A user's guide to tabu search.
Ann. Oper. Res., 1993

1991
Robust taboo search for the quadratic assignment problem.
Parallel Comput., 1991


  Loading...