Éric D. Taillard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2022

Unsupervised Machine Learning for the Quadratic Assignment ProblemThé Van Luong, Éric D. Taillard. metaheuristics 2023: 118-132 [doi]

A linearithmic heuristic for the travelling salesman problemÉric D. Taillard. eor, 297(2):442-450, 2022. [doi]

2019

POPMUSIC for the travelling salesman problemÉric D. Taillard, Keld Helsgaun. eor, 272(2):420-429, 2019. [doi]

2013

POPMUSIC for the world location-routing problemAdriana C. F. Alvim, Éric D. Taillard. ejtl, 2(3):231-254, 2013. [doi]

2012

Parallelization Strategies for Hybrid Metaheuristics Using a Single GPU and Multi-core ResourcesThé Van Luong, Éric D. Taillard, Nouredine Melab, El-Ghazali Talbi. ppsn 2012: 368-377 [doi]

2009

2008

Few statistical tests for proportions comparisonÉric D. Taillard, Philippe Waelti, Jacques Zuber. eor, 185(3):1336-1350, 2008. [doi]

Feature cluster on papers presented at the FRANCORO IV conferenceÉric D. Taillard, Marino Widmer. eor, 185(3):1274-1275, 2008. [doi]

2007

Analysis and test of efficient methods for building recursive deterministic perceptron neural networksDavid A. Elizondo, Ralph Birkenhead, Mario A. Góngora, Éric D. Taillard, Patrick Luyima. NN, 20(10):1095-1108, 2007. [doi]

2006

The Generalisation of the Recursive Deterministic PerceptronDavid Elizondo, Ralph Birkenhead, Éric D. Taillard. ijcnn 2006: 1776-1783 [doi]

2005

Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic MethodsZvi Drezner, Peter M. Hahn, Éric D. Taillard. anor, 139(1):65-94, 2005. [doi]

2003

Heuristic Methods for Large Centroid Clustering ProblemsÉric D. Taillard. heuristics, 9(1):51-73, 2003.

2001

Adaptive memory programming: A unified view of metaheuristicsÉric D. Taillard, Luca Maria Gambardella, Michel Gendreau, Jean-Yves Potvin. eor, 135(1):1-16, 2001. [doi]

2000

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber ProblemJack Brimberg, Pierre Hansen, Nenad Mladenovic, Éric D. Taillard. ior, 48(3):444-460, 2000. [doi]

1999

Ant colonies for the quadratic assignment problemLuca Maria Gambardella, Éric D. Taillard, Marco Dorigo. jors, 50(2):167-176, 1999. [doi]

A tabu search heuristic for the heterogeneous fleet vehicle routing problemMichel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard. cor, 26(12):1153-1173, 1999. [doi]

A heuristic column generation method for the heterogeneous fleet VRPÉric D. Taillard. rairo, 33(1):1-14, 1999. [doi]

1998

Heuristic solution of the multisource Weber problem as a p-median problemPierre Hansen, Nenad Mladenovic, Éric D. Taillard. orl, 22(2-3):55-62, 1998. [doi]

1997

An adaptive memory heuristic for a class of vehicle routing problems with minmax objectiveBruce L. Golden, Gilbert Laporte, Éric D. Taillard. cor, 24(5):445-452, 1997. [doi]

1995

Probabilistic diversification and intensification in local search for vehicle routingYves Rochat, Éric D. Taillard. heuristics, 1(1):147-167, 1995. [doi]

1993

A user's guide to tabu searchFred Glover, Éric D. Taillard. anor, 41(1):1-28, 1993. [doi]

Solving real-life vehicle routing problems efficiently using tabu searchFrédéric Semet, Éric D. Taillard. anor, 41(4):469-488, 1993. [doi]

Parallel iterative search methods for vehicle routing problemsÉric D. Taillard. networks, 23(8):661-673, 1993. [doi]

1991

Robust taboo search for the quadratic assignment problemÉric D. Taillard. pc, 17(4-5):443-455, 1991.

Sign in or sign up to see more results.

runs on WebDSL