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.
Theory of Linear and Integer Programming
20002.7k citationsAdam N. Letchford et al.Journal of the Operational Research Societyprofile →
A new branch-and-cut algorithm for the capacitated vehicle routing problem
2004432 citationsAdam N. Letchford et al.Mathematical Programmingprofile →
Non-convex mixed-integer nonlinear programming: A survey
2012379 citationsAdam N. Letchford et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Adam N. Letchford
Since
Specialization
Citations
This map shows the geographic impact of Adam N. Letchford'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 Adam N. Letchford with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Adam N. Letchford more than expected).
Fields of papers citing papers by Adam N. Letchford
This network shows the impact of papers produced by Adam N. Letchford. 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 Adam N. Letchford. The network helps show where Adam N. Letchford may publish in the future.
Co-authorship network of co-authors of Adam N. Letchford
This figure shows the co-authorship network connecting the top 25 collaborators of Adam N. Letchford.
A scholar is included among the top collaborators of Adam N. Letchford 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 Adam N. Letchford. Adam N. Letchford is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Boschetti, Marco Antonio, Adam N. Letchford, & Vittorio Maniezzo. (2023). Matheuristics: survey and synthesis. International Transactions in Operational Research. 30(6). 2840–2866.12 indexed citations
Letchford, Adam N., et al.. (2005). A fast algorithm for minimum weight odd cuts and circuits in planar graphs. Lancaster EPrints (Lancaster University).1 indexed citations
16.
Letchford, Adam N.. (2004). Computing good allocations for combinatorial optimization games. Lancaster EPrints (Lancaster University).
17.
Letchford, Adam N.. (2003). Good allocations for traveling salesman and vehicle routing games. Lancaster EPrints (Lancaster University).1 indexed citations
18.
Letchford, Adam N. & Andrea Lodi. (2003). Primal separation algorithms. PolyPublie (École Polytechnique de Montréal). 1(3). 209–224.2 indexed citations
19.
Letchford, Adam N.. (2002). Approximation Algorithms. Journal of the Operational Research Society. 53(7). 807–808.103 indexed citations
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.