default search action
Éric D. Taillard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j26]Éric D. Taillard:
A linearithmic heuristic for the travelling salesman problem. Eur. J. Oper. Res. 297(2): 442-450 (2022) - [c4]Thé Van Luong
, Éric D. Taillard:
Unsupervised Machine Learning for the Quadratic Assignment Problem. MIC 2022: 118-132
2010 – 2019
- 2019
- [j25]Éric D. Taillard, Keld Helsgaun:
POPMUSIC for the travelling salesman problem. Eur. J. Oper. Res. 272(2): 420-429 (2019) - 2018
- [r1]Éric D. Taillard, Stefan Voß:
POPMUSIC. Handbook of Heuristics 2018: 687-701 - 2013
- [j24]Adriana C. F. Alvim
POPMUSIC for the world location-routing problem. EURO J. Transp. Logist. 2(3): 231-254 (2013) - 2012
- [c3]Thé Van Luong
Parallelization Strategies for Hybrid Metaheuristics Using a Single GPU and Multi-core Resources. PPSN (2) 2012: 368-377
2000 – 2009
- 2009
- [j23]Adriana C. F. Alvim
POPMUSIC for the point feature label placement problem. Eur. J. Oper. Res. 192(2): 396-413 (2009) - [j22]Patrick Siarry, Éric D. Taillard:
Feature cluster INCOM 2006 Metaheuristics: Transportation and logistics. Eur. J. Oper. Res. 195(3): 701-702 (2009) - [j21]Alexander Ostertag, Karl F. Doerner
POPMUSIC for a real-world large-scale vehicle routing problem with time windows. J. Oper. Res. Soc. 60(7): 934-943 (2009) - [c2]Olivier Ertz, Maxence Laurent
Towards an Automated Label Placement Service. OGRS 2009: 157-171 - 2008
- [j20]Éric D. Taillard, Marino Widmer
Feature cluster on papers presented at the FRANCORO IV conference. Eur. J. Oper. Res. 185(3): 1274-1275 (2008) - [j19]Éric D. Taillard, Philippe Waelti, Jacques Zuber:
Few statistical tests for proportions comparison. Eur. J. Oper. Res. 185(3): 1336-1350 (2008) - 2007
- [j18]David A. Elizondo, Ralph Birkenhead, Mario Gongora, Éric D. Taillard, Patrick Luyima:
Analysis and test of efficient methods for building recursive deterministic perceptron neural networks. Neural Networks 20(10): 1095-1108 (2007) - 2006
- [c1]David A. Elizondo, Ralph Birkenhead, Éric D. Taillard:
The Generalisation of the Recursive Deterministic Perceptron. IJCNN 2006: 1776-1783 - 2005
- [j17]Zvi Drezner, Peter M. Hahn, Éric D. Taillard:
Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods. Ann. Oper. Res. 139(1): 65-94 (2005) - 2003
- [j16]Éric D. Taillard:
Heuristic Methods for Large Centroid Clustering Problems. J. Heuristics 9(1): 51-73 (2003) - 2001
- [j15]Éric D. Taillard, Luca Maria Gambardella, Michel Gendreau, Jean-Yves Potvin:
Adaptive memory programming: A unified view of metaheuristics. Eur. J. Oper. Res. 135(1): 1-16 (2001) - 2000
- [j14]Jack Brimberg, Pierre Hansen, Nenad Mladenovic
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem. Oper. Res. 48(3): 444-460 (2000)
1990 – 1999
- 1999
- [j13]Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard:
A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12): 1153-1173 (1999) - [j12]Luca Maria Gambardella, Éric D. Taillard, Marco Dorigo
Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2): 167-176 (1999) - [j11]Éric D. Taillard:
A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Oper. Res. 33(1): 1-14 (1999) - [j10]Michel Gendreau, François Guertin, Jean-Yves Potvin, Éric D. Taillard:
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transp. Sci. 33(4): 381-390 (1999) - 1998
- [j9]Pierre Hansen, Nenad Mladenovic
Heuristic solution of the multisource Weber problem as a p-median problem. Oper. Res. Lett. 22(2-3): 55-62 (1998) - 1997
- [j8]Bruce L. Golden, Gilbert Laporte, Éric D. Taillard:
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 24(5): 445-452 (1997) - [j7]Éric D. Taillard, Philippe Badeau, Michel Gendreau, François Guertin, Jean-Yves Potvin:
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transp. Sci. 31(2): 170-186 (1997) - 1995
- [j6]Yves Rochat, Éric D. Taillard:
Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1): 147-167 (1995) - 1994
- [j5]Éric D. Taillard:
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. INFORMS J. Comput. 6(2): 108-117 (1994) - 1993
- [j4]Fred W. Glover, Éric D. Taillard:
A user's guide to tabu search. Ann. Oper. Res. 41(1): 1-28 (1993) - [j3]Frédéric Semet
Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41(4): 469-488 (1993) - [j2]Éric D. Taillard:
Parallel iterative search methods for vehicle routing problems. Networks 23(8): 661-673 (1993) - 1991
- [j1]Éric D. Taillard:
Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4-5): 443-455 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: