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.
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem
2007311 citationsClaudia Archetti, M. Grazia Speranza et al.Transportation Scienceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Claudia Archetti
Since
Specialization
Citations
This map shows the geographic impact of Claudia Archetti'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 Claudia Archetti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Claudia Archetti more than expected).
Fields of papers citing papers by Claudia Archetti
This network shows the impact of papers produced by Claudia Archetti. 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 Claudia Archetti. The network helps show where Claudia Archetti may publish in the future.
Co-authorship network of co-authors of Claudia Archetti
This figure shows the co-authorship network connecting the top 25 collaborators of Claudia Archetti.
A scholar is included among the top collaborators of Claudia Archetti 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 Claudia Archetti. Claudia Archetti is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Archetti, Claudia, et al.. (2013). Vehicle Routing Problems with Profits. Institutional Research Information System (Università degli Studi di Brescia).61 indexed citations
13.
Goel, Asvin, Claudia Archetti, & Martin Savelsbergh. (2011). Truck Driver Scheduling in Australia. SSRN Electronic Journal.5 indexed citations
14.
Hertz, Alain, Claudia Archetti, M. Grazia Speranza, & Nicola Bianchessi. (2011). Incomplete Service and Split Deliveries in a Routing Problem with Profits. Les Cahiers du GERAD. 1–16.2 indexed citations
15.
Archetti, Claudia, Nicola Bianchessi, & Alain Hertz. (2011). A Branch-and-Price Algorithm for the Robust Graph Coloring Problem. PolyPublie (École Polytechnique de Montréal). 1–18.2 indexed citations
16.
Archetti, Claudia, Nicola Bianchessi, Alain Hertz, & M. Grazia Speranza. (2010). The Split Delivery Capacitated Team Orienteering Problem. PolyPublie (École Polytechnique de Montréal). 1–26.5 indexed citations
17.
Hertz, Alain, Claudia Archetti, M. Grazia Speranza, & Dominique Feillet. (2009). The Capacitated Arc Routing Problem with Profits. Les Cahiers du GERAD. 1–20.2 indexed citations
18.
Archetti, Claudia, Dominique Feillet, Alain Hertz, & M. Grazia Speranza. (2007). The Capacitated Team Orienteering and Profitable Tour Problems. PolyPublie (École Polytechnique de Montréal). 1–24.2 indexed citations
19.
Hertz, Alain, Claudia Archetti, & M. Grazia Speranza. (2003). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Les Cahiers du GERAD. 1–18.2 indexed citations
20.
Archetti, Claudia, Renata Mansini, & M. Grazia Speranza. (2001). The Vehicle Routing Problem With Capacity 2 And 3, General Distances And Multiple Customer Visits.4 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.