Aristide Mingozzi

5.7k total citations · 2 hit papers
49 papers, 4.0k citations indexed

About

Aristide Mingozzi is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and Building and Construction. According to data from OpenAlex, Aristide Mingozzi has authored 49 papers receiving a total of 4.0k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Industrial and Manufacturing Engineering, 19 papers in Automotive Engineering and 10 papers in Building and Construction. Recurrent topics in Aristide Mingozzi's work include Vehicle Routing Optimization Methods (39 papers), Optimization and Packing Problems (23 papers) and Transportation and Mobility Innovations (19 papers). Aristide Mingozzi is often cited by papers focused on Vehicle Routing Optimization Methods (39 papers), Optimization and Packing Problems (23 papers) and Transportation and Mobility Innovations (19 papers). Aristide Mingozzi collaborates with scholars based in Italy, United Kingdom and France. Aristide Mingozzi's co-authors include Roberto Baldacci, Roberto Roberti, Paolo Toth, Nicos Christofides, Salvatore Ricciardelli, Vittorio Maniezzo, Lucio Bianco, N.D. Christofides, Eleni Hadjiconstantinou and Enrico Bartolini and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Aristide Mingozzi

48 papers receiving 3.8k citations

Hit Papers

align trajectories

What are hit papers?

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.

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

2011 350 citations Roberto Baldacci, Aristide Mingozzi et al. Operations Research profile →
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

1981 340 citations N.D. Christofides, Aristide Mingozzi et al. Mathematical Programming profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Aristide Mingozzi Italy	33	3.4k	1.7k	1.3k	505	435	49	4.0k
Moshe Dror United States	35	3.0k 0.9×	1.2k 0.7×	876 0.7×	357 0.7×	668 1.5×	124	4.1k
Dominique Feillet France	37	3.5k 1.0×	1.6k 1.0×	1.3k 1.1×	703 1.4×	199 0.5×	97	4.2k
Guy Desaulniers Canada	39	3.6k 1.0×	1.5k 0.9×	879 0.7×	608 1.2×	549 1.3×	187	4.4k
Claudia Archetti Italy	40	4.0k 1.2×	1.8k 1.1×	1.7k 1.4×	466 0.9×	220 0.5×	133	4.8k
Juan‐José Salazar‐González Spain	34	2.7k 0.8×	1.0k 0.6×	835 0.7×	436 0.9×	241 0.6×	105	3.4k
François Soumis Canada	40	5.1k 1.5×	2.2k 1.3×	957 0.8×	1.0k 2.0×	1.0k 2.4×	166	6.1k
Roberto Baldacci Italy	35	3.5k 1.0×	1.8k 1.1×	1.6k 1.2×	490 1.0×	144 0.3×	108	4.2k
Barrett W. Thomas United States	31	1.8k 0.5×	1.3k 0.8×	833 0.7×	585 1.2×	179 0.4×	64	2.6k
Olli Bräysy Finland	23	3.1k 0.9×	1.6k 1.0×	1.1k 0.8×	340 0.7×	143 0.3×	40	3.5k
Arjang A. Assad United States	22	2.0k 0.6×	831 0.5×	682 0.5×	491 1.0×	186 0.4×	59	2.6k

Countries citing papers authored by Aristide Mingozzi

Since Specialization

Citations

This map shows the geographic impact of Aristide Mingozzi'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 Aristide Mingozzi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aristide Mingozzi more than expected).

Fields of papers citing papers by Aristide Mingozzi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Aristide Mingozzi. 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 Aristide Mingozzi. The network helps show where Aristide Mingozzi may publish in the future.

Co-authorship network of co-authors of Aristide Mingozzi

This figure shows the co-authorship network connecting the top 25 collaborators of Aristide Mingozzi. A scholar is included among the top collaborators of Aristide Mingozzi 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 Aristide Mingozzi. Aristide Mingozzi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Roberti, Roberto & Aristide Mingozzi. (2013). Dynamic ng-Path Relaxation for the Delivery Man Problem. Transportation Science. 48(3). 413–424. 38 indexed citations

Mingozzi, Aristide, Roberto Roberti, & Paolo Toth. (2012). An Exact Algorithm for the Multitrip Vehicle Routing Problem. INFORMS journal on computing. 25(2). 193–207. 79 indexed citations

Baldacci, Roberto, Enrico Bartolini, & Aristide Mingozzi. (2011). An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Operations Research. 59(2). 414–426. 152 indexed citations

Baldacci, Roberto, Aristide Mingozzi, & Roberto Roberti. (2011). New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS journal on computing. 24(3). 356–371. 61 indexed citations

Baldacci, Roberto, Enrico Bartolini, Aristide Mingozzi, & Roberto Roberti. (2009). An exact solution framework for a broad class of vehicle routing problems. Computational Management Science. 7(3). 229–268. 54 indexed citations

Boschetti, Marco Antonio, Aristide Mingozzi, & Salvatore Ricciardelli. (2008). A dual ascent procedure for the set partitioning problem. Discrete Optimization. 5(4). 735–747. 23 indexed citations

Bartolini, Enrico & Aristide Mingozzi. (2008). Algorithms for the non-bifurcated network design problem. Journal of Heuristics. 15(3). 259–281. 9 indexed citations

Baldacci, Roberto, Nicos Christofides, & Aristide Mingozzi. (2007). An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming. 115(2). 351–385. 238 indexed citations

Baldacci, Roberto, Lawrence Bodin, & Aristide Mingozzi. (2006). The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem. Computers & Operations Research. 33(9). 2667–2702. 54 indexed citations

10.

Mingozzi, Aristide, Christian Prins, & Roberto Wolfler Calvo. (2006). Capacitated Depot Location for the Vehicle Routing Problem. SPIRE - Sciences Po Institutional REpository. 38. 1547–1551. 1 indexed citations

11.

Boschetti, Marco Antonio & Aristide Mingozzi. (2003). The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR. 1(1). 55 indexed citations

12.

Mingozzi, Aristide & Serena Morigi. (2002). Partitioning a matrix with non-guillotine cuts to minimize the maximum cost. Discrete Applied Mathematics. 116(3). 243–260. 1 indexed citations

13.

Bodin, Lawrence, Aristide Mingozzi, Roberto Baldacci, & Michael O. Ball. (2000). The Rollon–Rolloff Vehicle Routing Problem. Transportation Science. 34(3). 271–288. 69 indexed citations

14.

Mingozzi, Aristide, Marco Antonio Boschetti, Salvatore Ricciardelli, & L. Bianco. (1999). A Set Partitioning Approach to the Crew Scheduling Problem. Operations Research. 47(6). 873–888. 56 indexed citations

15.

Mingozzi, Aristide, Lucio Bianco, & Salvatore Ricciardelli. (1997). Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints. Operations Research. 45(3). 365–377. 82 indexed citations

16.

Hadjiconstantinou, Eleni, Nicos Christofides, & Aristide Mingozzi. (1995). A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. Annals of Operations Research. 61(1). 21–43. 57 indexed citations

17.

Bianco, Lucio, et al.. (1994). Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming. INFOR Information Systems and Operational Research. 32(1). 19–32. 37 indexed citations

18.

Christofides, N.D., Aristide Mingozzi, & Paolo Toth. (1981). Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming. 20(1). 255–282. 340 indexed citations breakdown →

19.

Christofides, Nicos, Aristide Mingozzi, & Paolo Toth. (1981). State‐space relaxation procedures for the computation of bounds to routing problems. Networks. 11(2). 145–164. 236 indexed citations

20.

Christofides, Nicos, et al.. (1976). Optimal Loading and Unloading Operations at an Oil Terminal.. Defense Technical Information Center (DTIC). 2 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.

Explore authors with similar magnitude of impact