Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Benchmarks for basic scheduling problems
19931.7k citationsÉric D. TaillardEuropean Journal of Operational Researchprofile →
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
1997661 citationsÉric D. Taillard, Michel Gendreau et al.Transportation Scienceprofile →
A user's guide to tabu search
1993637 citationsÉric D. Taillard, Éric D. Taillard et al.Annals of Operations Researchprofile →
Some efficient heuristic methods for the flow shop sequencing problem
1990633 citationsÉric D. TaillardEuropean Journal of Operational Researchprofile →
Probabilistic diversification and intensification in local search for vehicle routing
1995617 citationsÉric D. Taillard et al.Journal of Heuristicsprofile →
Robust taboo search for the quadratic assignment problem
Countries citing papers authored by Éric D. Taillard
Since
Specialization
Citations
This map shows the geographic impact of Éric D. Taillard's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Éric D. Taillard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Éric D. Taillard more than expected).
Fields of papers citing papers by Éric D. Taillard
This network shows the impact of papers produced by Éric D. Taillard. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Éric D. Taillard. The network helps show where Éric D. Taillard may publish in the future.
Co-authorship network of co-authors of Éric D. Taillard
This figure shows the co-authorship network connecting the top 25 collaborators of Éric D. Taillard.
A scholar is included among the top collaborators of Éric D. Taillard based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Éric D. Taillard. Éric D. Taillard is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Elizondo, David, et al.. (2006). Generalisation and the recursive deterministic perceptron.. DMU Open Research Archive (De Montfort University).3 indexed citations
Taillard, Éric D., et al.. (1997). A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science. 31(2). 170–186.661 indexed citations breakdown →
Hansen, Pierre, Nenad Mladenović, & Éric D. Taillard. (1996). Heuristic Solution of the Multisource Weber Problem as a p -median Problem. Les Cahiers du GERAD. 1–16.1 indexed citations
12.
Gambardella, Luca Maria, Gianluca Bontempi, & Éric D. Taillard. (1996). Simulation and Forecasting in an Intermodal Container Terminal. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 626–630.22 indexed citations
13.
Gendreau, Michel, et al.. (1996). A SOLUTION PROCEDURE FOR REAL-TIME ROUTING AND DISPATCHING OF COMMERCIAL VEHICLES.7 indexed citations
14.
Taillard, Éric D., Gilbert Laporte, & Michel Gendreau. (1996). Vehicle Routeing with Multiple Use of Vehicles. Journal of the Operational Research Society. 47(8). 1065–1070.167 indexed citations
15.
Taillard, Éric D., et al.. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1(1). 147–167.617 indexed citations breakdown →
Taillard, Éric D.. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research. 47(1). 65–74.633 indexed citations breakdown →
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.