Michele Monaci

5.1k total citations · 1 hit paper
84 papers, 3.0k citations indexed

About

Michele Monaci is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Michele Monaci has authored 84 papers receiving a total of 3.0k indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Industrial and Manufacturing Engineering, 19 papers in Computer Networks and Communications and 16 papers in Computational Theory and Mathematics. Recurrent topics in Michele Monaci's work include Optimization and Packing Problems (35 papers), Advanced Manufacturing and Logistics Optimization (26 papers) and Vehicle Routing Optimization Methods (26 papers). Michele Monaci is often cited by papers focused on Optimization and Packing Problems (35 papers), Advanced Manufacturing and Logistics Optimization (26 papers) and Vehicle Routing Optimization Methods (26 papers). Michele Monaci collaborates with scholars based in Italy, France and Austria. Michele Monaci's co-authors include Silvano Martello, Andrea Lodi, Matteo Fischetti, Paolo Toth, Alberto Caprara, Daniele Vigo, Enrico Malaguti, Markus Sinnl, Ivana Ljubić and Pier Luigi Guida and has published in prestigious journals such as Management Science, European Journal of Operational Research and Operations Research.

In The Last Decade

Michele Monaci

83 papers receiving 2.8k citations

Hit Papers

Two-dimensional packing problems: A survey 2002 2026 2010 2018 2002 100 200 300 400 500

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Michele Monaci Italy 29 2.1k 511 434 396 293 84 3.0k
Arie Tamir Israel 28 1.0k 0.5× 489 1.0× 680 1.6× 345 0.9× 817 2.8× 119 2.7k
Manuel Iori Italy 36 3.0k 1.4× 205 0.4× 354 0.8× 143 0.4× 114 0.4× 122 4.0k
Mauro Dell’Amico Italy 31 2.6k 1.2× 117 0.2× 716 1.6× 236 0.6× 297 1.0× 105 4.0k
José Fernando Gonçalves Portugal 23 2.2k 1.0× 129 0.3× 297 0.7× 495 1.3× 223 0.8× 43 2.8k
Richard L. Francis United States 28 1.6k 0.7× 220 0.4× 382 0.9× 195 0.5× 299 1.0× 96 3.1k
Y.P. Aneja Canada 20 951 0.4× 71 0.1× 285 0.7× 168 0.4× 309 1.1× 97 1.7k
J. MacGregor Smith United States 29 894 0.4× 99 0.2× 380 0.9× 263 0.7× 196 0.7× 116 2.7k
Francesco Maffioli Italy 23 825 0.4× 120 0.2× 439 1.0× 117 0.3× 550 1.9× 87 1.8k
Frits Spieksma Belgium 27 1.5k 0.7× 42 0.1× 438 1.0× 468 1.2× 279 1.0× 166 2.5k
Pamela H. Vance United States 10 1.9k 0.9× 51 0.1× 417 1.0× 381 1.0× 144 0.5× 12 2.5k

Countries citing papers authored by Michele Monaci

Since Specialization
Citations

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

Fields of papers citing papers by Michele Monaci

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Michele Monaci

This figure shows the co-authorship network connecting the top 25 collaborators of Michele Monaci. A scholar is included among the top collaborators of Michele Monaci 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 Michele Monaci. Michele Monaci 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.
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
4.
Iori, Manuel, et al.. (2020). Exact solution techniques for two-dimensional cutting and packing. European Journal of Operational Research. 289(2). 399–415. 74 indexed citations
5.
D’Ambrosio, Claudia, Silvano Martello, & Michele Monaci. (2020). Lower and upper bounds for the non-linear generalized assignment problem. Computers & Operations Research. 120. 104933–104933. 13 indexed citations
6.
Fischetti, Matteo, Michele Monaci, & Markus Sinnl. (2017). A dynamic reformulation heuristic for Generalized Interdiction Problems. European Journal of Operational Research. 267(1). 40–51. 21 indexed citations
7.
Caprara, Alberto, Marco Locatelli, & Michele Monaci. (2016). Theoretical and computational results about optimality-based domain reductions. Computational Optimization and Applications. 64(2). 513–533. 6 indexed citations
8.
Fischetti, Martina & Michele Monaci. (2015). Proximity search heuristics for wind farm optimal layout. Journal of Heuristics. 22(4). 459–474. 30 indexed citations
9.
Lodi, Andrea, et al.. (2015). Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints. Discrete Applied Mathematics. 217. 40–47. 15 indexed citations
10.
Fischetti, Matteo, Andrea Lodi, Michele Monaci, Domenico Salvagnin, & Andrea Tramontani. (2015). Improving branch-and-cut performance by random sampling. Mathematical Programming Computation. 8(1). 113–132. 15 indexed citations
11.
Fischetti, Matteo, Michele Monaci, & Domenico Salvagnin. (2015). Mixed-integer linear programming heuristics for the prepack optimization problem. Discrete Optimization. 22. 195–205. 8 indexed citations
12.
Monaci, Michele, Ulrich Pferschy, & Paolo Serafini. (2013). Exact solution of the robust knapsack problem. Computers & Operations Research. 40(11). 2625–2631. 45 indexed citations
13.
Andreatta, Giovanni, et al.. (2013). Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling. Journal of Intelligent Transportation Systems. 18(1). 121–130. 17 indexed citations
14.
Lodi, Andrea, Silvano Martello, Michele Monaci, & Daniele Vigo. (2013). Two‐Dimensional Bin Packing Problems. Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna). 107–129. 3 indexed citations
15.
Fischetti, Matteo, Michele Monaci, & Domenico Salvagnin. (2012). Three Ideas for the Quadratic Assignment Problem. Operations Research. 60(4). 954–964. 29 indexed citations
16.
Dell’Amico, Mauro, Manuel Iori, Silvano Martello, & Michele Monaci. (2012). A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. Journal of Heuristics. 18(6). 939–942. 2 indexed citations
17.
Monaci, Michele & Ulrich Pferschy. (2011). On the Robust Knapsack Problem.. 207–210. 2 indexed citations
18.
Fischetti, Matteo & Michele Monaci. (2007). How tight is the corner relaxation?. Discrete Optimization. 5(2). 262–269. 9 indexed citations
19.
Caprara, Alberto, Andrea Lodi, Silvano Martello, & Michele Monaci. (2006). Packing into the smallest square: Worst-case analysis of lower bounds. Discrete Optimization. 3(4). 317–326. 6 indexed citations
20.
Caprara, Alberto, Michele Monaci, Paolo Toth, & Pier Luigi Guida. (2005). A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics. 154(5). 738–753. 171 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