Enrico Malaguti

1.7k total citations
55 papers, 1.1k citations indexed

About

Enrico Malaguti is a scholar working on Industrial and Manufacturing Engineering, Management Science and Operations Research and Computational Theory and Mathematics. According to data from OpenAlex, Enrico Malaguti has authored 55 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Industrial and Manufacturing Engineering, 19 papers in Management Science and Operations Research and 15 papers in Computational Theory and Mathematics. Recurrent topics in Enrico Malaguti's work include Vehicle Routing Optimization Methods (29 papers), Optimization and Packing Problems (18 papers) and Scheduling and Timetabling Solutions (14 papers). Enrico Malaguti is often cited by papers focused on Vehicle Routing Optimization Methods (29 papers), Optimization and Packing Problems (18 papers) and Scheduling and Timetabling Solutions (14 papers). Enrico Malaguti collaborates with scholars based in Italy, France and Chile. Enrico Malaguti's co-authors include Paolo Toth, Fabio Furini, Michele Monaci, Claudio Gambella, Daniele Vigo, Manuel Iori, Alberto Caprara, Dimitri Thomopulos, Andrea Bettinelli and Valentina Cacchiani and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Enrico Malaguti

53 papers receiving 1.0k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Enrico Malaguti Italy 17 660 302 213 208 131 55 1.1k
Marco E. Lübbecke Germany 15 798 1.2× 224 0.7× 144 0.7× 272 1.3× 179 1.4× 41 1.3k
François Vanderbeck France 17 943 1.4× 160 0.5× 100 0.5× 198 1.0× 136 1.0× 31 1.2k
Karla Hoffman United States 15 482 0.7× 206 0.7× 190 0.9× 191 0.9× 80 0.6× 46 1.0k
Sven O. Krumke Germany 15 367 0.6× 143 0.5× 167 0.8× 395 1.9× 99 0.8× 86 1.0k
Maria Grazia Scutellà Italy 19 704 1.1× 266 0.9× 150 0.7× 286 1.4× 180 1.4× 74 1.4k
Viswanath Nagarajan United States 16 220 0.3× 161 0.5× 331 1.6× 396 1.9× 78 0.6× 76 862
Aziz Moukrim France 18 967 1.5× 223 0.7× 108 0.5× 131 0.6× 146 1.1× 69 1.2k
Domenico Salvagnin Italy 14 427 0.6× 162 0.5× 224 1.1× 171 0.8× 43 0.3× 37 967
Fabio Furini France 19 552 0.8× 151 0.5× 176 0.8× 191 0.9× 39 0.3× 51 947
Gilles Pesant Canada 21 614 0.9× 268 0.9× 158 0.7× 323 1.6× 176 1.3× 68 1.2k

Countries citing papers authored by Enrico Malaguti

Since Specialization
Citations

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

Fields of papers citing papers by Enrico Malaguti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Enrico Malaguti

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

All Works

20 of 20 papers shown
1.
Delorme, Maxence, et al.. (2024). Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. European Journal of Operational Research. 320(1). 57–68. 1 indexed citations
2.
Lodi, Andrea, et al.. (2023). A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Mathematical Programming. 205(1-2). 269–301.
3.
Lefebvre, Henri, et al.. (2023). Adjustable robust optimization with objective uncertainty. European Journal of Operational Research. 312(1). 373–384. 4 indexed citations
4.
Malaguti, Enrico, et al.. (2023). A decision support system for scheduling a vaccination campaign during a pandemic emergency: The COVID-19 case. Computers & Industrial Engineering. 177. 109068–109068. 4 indexed citations
5.
Campana, Giampaolo, et al.. (2022). Scheduling of semi-automatic carousels with fixed production sequences. International Journal of Production Research. 61(4). 1252–1267. 1 indexed citations
6.
Malaguti, Enrico, et al.. (2022). Network Design with Service Requirements: Scaling-up the Size of Solvable Problems. INFORMS journal on computing. 34(5). 2571–2582. 3 indexed citations
7.
Malaguti, Enrico, et al.. (2021). In search of dense subgraphs: How good is greedy peeling?. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). 8 indexed citations
8.
Furini, Fabio, et al.. (2021). Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Operations Research. 70(4). 2399–2420. 7 indexed citations
9.
Lodi, Andrea, Enrico Malaguti, Giacomo Nannicini, & Dimitri Thomopulos. (2019). Nonlinear chance-constrained problems with applications to hydro scheduling. Mathematical Programming. 191(1). 405–444. 7 indexed citations
10.
Furini, Fabio, et al.. (2019). On integer and bilevel formulations for the k-vertex cut problem. Mathematical Programming Computation. 12(2). 133–164. 15 indexed citations
11.
Furini, Fabio, et al.. (2018). The vertex k -cut problem. Discrete Optimization. 31. 8–28. 12 indexed citations
12.
Malaguti, Enrico, et al.. (2018). Integer optimization with penalized fractional values: The Knapsack case. European Journal of Operational Research. 273(3). 874–888. 11 indexed citations
13.
Gambella, Claudio, et al.. (2017). Optimizing relocation operations in electric car-sharing. Omega. 81. 234–245. 110 indexed citations
14.
Malaguti, Enrico, et al.. (2017). Techniques for finding a list of solutions with increasing costs for the semi-assignment problem. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). 1. 1–5. 1 indexed citations
15.
Furini, Fabio, Enrico Malaguti, & Alberto Santini. (2017). An exact algorithm for the Partition Coloring Problem. Computers & Operations Research. 92. 170–181. 14 indexed citations
16.
Malaguti, Enrico, Silvano Martello, & Alberto Santini. (2017). The traveling salesman problem with pickups, deliveries, and draft limits. Omega. 74. 50–58. 25 indexed citations
17.
Furini, Fabio, et al.. (2016). Solving vertex coloring problems as maximum weight stable set problems. Discrete Applied Mathematics. 217. 151–162. 17 indexed citations
18.
Caprara, Alberto, et al.. (2016). Solving the Temporal Knapsack Problem via Recursive Dantzig–Wolfe Reformulation. Information Processing Letters. 116(5). 379–386. 16 indexed citations
19.
Malaguti, Enrico, et al.. (2013). Approaches to real world two-dimensional cutting problems. Omega. 47. 99–115. 35 indexed citations
20.
Iori, Manuel, et al.. (2009). Algorithms for the Bin Packing Problem with Conflicts. INFORMS journal on computing. 22(3). 401–415. 77 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

Rankless by CCL
2026