Monaldo Mastrolilli

2.5k total citations · 1 hit paper
48 papers, 1.2k citations indexed

About

Monaldo Mastrolilli is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Monaldo Mastrolilli has authored 48 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 35 papers in Industrial and Manufacturing Engineering, 27 papers in Computer Networks and Communications and 19 papers in Computational Theory and Mathematics. Recurrent topics in Monaldo Mastrolilli's work include Scheduling and Optimization Algorithms (25 papers), Optimization and Search Problems (23 papers) and Complexity and Algorithms in Graphs (15 papers). Monaldo Mastrolilli is often cited by papers focused on Scheduling and Optimization Algorithms (25 papers), Optimization and Search Problems (23 papers) and Complexity and Algorithms in Graphs (15 papers). Monaldo Mastrolilli collaborates with scholars based in Switzerland, Germany and United Kingdom. Monaldo Mastrolilli's co-authors include Luca Maria Gambardella, Ola Svensson, Klaus Jansen, L. M. Gambardella, Christoph Ambühl, Andrea Emilio Rizzoli, Marco Zaffalon, Luís Paquete, Roberto Montemanni and Marco Chiarandini and has published in prestigious journals such as European Journal of Operational Research, Journal of the ACM and Mathematical Programming.

In The Last Decade

Monaldo Mastrolilli

44 papers receiving 1.1k citations

Hit Papers

Effective neighbourhood functions for the flexible job sh... 2000 2026 2008 2017 2000 100 200 300
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.

  1. Effective neighbourhood functions for the flexible job shop problem
    2000 368 citations Monaldo Mastrolilli, Luca Maria Gambardella Journal of Scheduling profile →

Peers

Monaldo Mastrolilli
Imed Kacem France
César Rego United States
Vincent t'Kindt France
Sanja Petrović United Kingdom
Ted K. Ralphs United States
Martin Skutella Germany
Jérémie Dubois-Lacoste Belgium
Antoon Kolen Netherlands
François Vanderbeck France
Karla Hoffman United States
Imed Kacem France
Monaldo Mastrolilli
Citations per year, relative to Monaldo Mastrolilli Monaldo Mastrolilli (= 1×) peers Imed Kacem

Countries citing papers authored by Monaldo Mastrolilli

Since Specialization
Citations

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

Fields of papers citing papers by Monaldo Mastrolilli

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Monaldo Mastrolilli

This figure shows the co-authorship network connecting the top 25 collaborators of Monaldo Mastrolilli. A scholar is included among the top collaborators of Monaldo Mastrolilli 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 Monaldo Mastrolilli. Monaldo Mastrolilli 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.
Gualandi, Stefano, et al.. (2023). On the generation of metric TSP instances with a large integrality gap by branch-and-cut. Mathematical Programming Computation. 15(2). 389–416. 2 indexed citations
2.
Mastrolilli, Monaldo, et al.. (2017). Sum-of-squares rank upper bounds for matching problems. Journal of Combinatorial Optimization. 36(3). 831–844.
3.
Mastrolilli, Monaldo, et al.. (2017). Semidefinite and linear programming integrality gaps for scheduling identical machines. Mathematical Programming. 172(1-2). 231–248. 4 indexed citations
4.
Mastrolilli, Monaldo, et al.. (2013). Single machine scheduling with scenarios. Theoretical Computer Science. 477. 57–66. 24 indexed citations
5.
Mastrolilli, Monaldo & Georgios Stamoulis. (2013). Bi-criteria and approximation algorithms for restricted matchings. Theoretical Computer Science. 540-541. 115–132. 3 indexed citations
6.
Cygan, Marek, Fabrizio Grandoni, & Monaldo Mastrolilli. (2013). How to Sell Hyperedges: The Hypermatching Assignment Problem. 342–351. 8 indexed citations
7.
Kühn, Fabian & Monaldo Mastrolilli. (2012). Vertex cover in graphs with locally few colors. Information and Computation. 222. 265–277. 4 indexed citations
8.
Ambühl, Christoph, et al.. (2011). On the Approximability of Single-Machine Scheduling with Precedence Constraints. Mathematics of Operations Research. 36(4). 653–669. 10 indexed citations
9.
Ambühl, Christoph, et al.. (2008). Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 95. 37–58. 1 indexed citations
10.
Fishkin, Aleksei V., Klaus Jansen, & Monaldo Mastrolilli. (2007). Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica. 51(2). 183–199. 10 indexed citations
11.
Mastrolilli, Monaldo & Marcus Hütter. (2005). Hybrid rounding techniques for knapsack problems. Discrete Applied Mathematics. 154(4). 640–649. 8 indexed citations
12.
Bianchi, Leonora, Mauro Birattari, Marco Chiarandini, et al.. (2004). Metaheuristics for the vehicle routing problem with stochastic demands. Lecture notes in computer science. 3242. 450–460. 3 indexed citations
13.
Mastrolilli, Monaldo & Luca Maria Gambardella. (2004). MAX-2-SAT: how good is Tabu search in the worst-case?. National Conference on Artificial Intelligence. 173–178. 1 indexed citations
14.
Mastrolilli, Monaldo & Luca Maria Gambardella. (2004). Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?. European Journal of Operational Research. 166(1). 63–76. 15 indexed citations
15.
Jansen, Klaus, Monaldo Mastrolilli, & Roberto Solis-Oba. (2004). Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research. 167(2). 297–319. 43 indexed citations
16.
Sampels, Michaël, Mauro Birattari, Marco Chiarandini, et al.. (2003). A comparison of the performance of different metaheuristics on the timetabling problem. Lecture notes in computer science. 2740. 329–351. 101 indexed citations
17.
Mastrolilli, Monaldo. (2003). Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. Journal of Scheduling. 6(6). 521–531. 36 indexed citations
18.
Mastrolilli, Monaldo & Luca Maria Gambardella. (2000). Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling. 3(1). 3–20. 368 indexed citations breakdown →
19.
Mastrolilli, Monaldo & Luca Maria Gambardella. (2000). Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling. 3(1). 3–20. 57 indexed citations
20.
Rizzoli, Andrea Emilio, Luca Maria Gambardella, Gianluca Bontempi, & Monaldo Mastrolilli. (1997). Simulation of an intermodal container terminal to assist the management in the decision making process. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 5 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

Breakdown of academic impact, for papers by Imed Kacem Breakdown of academic impact, for papers by César Rego Breakdown of academic impact, for papers by Vincent t'Kindt Breakdown of academic impact, for papers by Sanja Petrović Breakdown of academic impact, for papers by Ted K. Ralphs Breakdown of academic impact, for papers by Martin Skutella Breakdown of academic impact, for papers by Jérémie Dubois-Lacoste Breakdown of academic impact, for papers by Antoon Kolen Breakdown of academic impact, for papers by François Vanderbeck Breakdown of academic impact, for papers by Karla Hoffman
Rankless by CCL
2026