M. Mastrolilli

Most-cited papers

Effective Neighborhood Functions for the Flexible Job Shop Problem
M. Mastrolilli, L. Gambardella
1998509 citations
Semantic Scholar
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem
Olivia Rossi-Doria, M. Sampels, M. Birattari, Marco Chiarandini +8 more
2002International Conference on the Practice and Theory of Automated Timetabling213 citations
Semantic Scholar
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
L. Bianchi, M. Birattari, Marco Chiarandini, Max Manfrin +4 more
2005J. Math. Model. Algorithms159 citations
Semantic Scholar
Experimental and Efficient Algorithms
K. Jansen, Marian Margraf, M. Mastrolilli, J. Rolim
2003Lecture Notes in Computer Science155 citations
Semantic Scholar
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
Christoph Ambuhl, M. Mastrolilli, O. Svensson
2007IEEE Annual Symposium on Foundations of Computer Science129 citations Open access
Semantic Scholar
An optimization methodology for intermodal terminal management
L. Gambardella, M. Mastrolilli, A. Rizzoli, Marco Zaffalon
2001Journal of Intelligent Manufacturing125 citations
Semantic Scholar
Heuristic algorithms for the robust traveling salesman problem 1 Heuristic algorithms for the robust traveling salesman problem with interval data
R. Montemanni, J. Barta, M. Mastrolilli, L. Gambardella
2006112 citations
Semantic Scholar
Minimizing the sum of weighted completion times in a concurrent open shop
M. Mastrolilli, M. Queyranne, Andreas S. Schulz, O. Svensson +1 more
2010Operations Research Letters89 citations Open access
Semantic Scholar
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
Christoph Ambuhl, M. Mastrolilli, O. Svensson
2011SIAM journal on computing (Print)83 citations Open access
Semantic Scholar
Approximation schemes for job shop scheduling problems with controllable processing times
K. Jansen, M. Mastrolilli, R. Solis-Oba
2005European Journal of Operational Research65 citations Open access
Semantic Scholar
Approximation algorithms for flexible job shop problems
K. Jansen, M. Mastrolilli, R. Solis-Oba
2005International Journal of Foundations of Computer Science55 citations
Semantic Scholar
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times
M. Mastrolilli
2003Journal of Scheduling55 citations
Semantic Scholar
How to Sell Hyperedges: The Hypermatching Assignment Problem
M. Cygan, F. Grandoni, M. Mastrolilli
2013ACM-SIAM Symposium on Discrete Algorithms50 citations
Semantic Scholar
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Christoph Ambuhl, M. Mastrolilli
2009Algorithmica50 citations
Semantic Scholar
Hardness of Approximating Flow and Job Shop Scheduling Problems
M. Mastrolilli, O. Svensson
2011JACM36 citations Open access
Semantic Scholar
Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
L. Bianchi, M. Birattari, Marco Chiarandini, Max Manfrin +4 more
200436 citations
Semantic Scholar
Single machine scheduling with scenarios
M. Mastrolilli, Nikolaus Mutsanas, O. Svensson
2013Theoretical Computer Science33 citations Open access
Semantic Scholar
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
Adam Kurpisz, Samuli Leppänen, M. Mastrolilli
2015Mathematics of Operations Research31 citations Open access
Semantic Scholar
Parallel Machine Scheduling Problems with Controllable Processing Times
K. Jansen, M. Mastrolilli
2000ICALP Satellite Workshops31 citations
Semantic Scholar
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Christoph Ambuhl, M. Mastrolilli, Nikolaus Mutsanas, O. Svensson
2011Mathematics of Operations Research30 citations Open access
Semantic Scholar
Grouping Techniques for Scheduling Problems: Simpler and Faster
A. V. Fishkin, K. Jansen, M. Mastrolilli
2001Algorithmica29 citations Open access
Semantic Scholar
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Christoph Ambuhl, M. Mastrolilli
2005Operations Research Letters27 citations
Semantic Scholar
Approximation of Minimum Cost Homomorphisms
P. Hell, M. Mastrolilli, M. M. Nevisi, A. Rafiey
2012Embedded Systems and Applications25 citations
Semantic Scholar
Hybrid rounding techniques for knapsack problems
M. Mastrolilli, Marcus Hutter
2003Discrete Applied Mathematics25 citations Open access
Semantic Scholar
Sum-of-squares hierarchy lower bounds for symmetric formulations
Adam Kurpisz, Samuli Leppänen, M. Mastrolilli
2014Mathematical programming24 citations Open access
Semantic Scholar
Hybridizations of Metaheuristics With Branch & Bound Derivates
C. Blum, C. Cotta, Antonio J. Fernández, J. E. Gallardo +1 more
2008Hybrid Metaheuristics23 citations Open access
Semantic Scholar
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
M. Mastrolilli, L. Gambardella
2005European Journal of Operational Research23 citations Open access
Semantic Scholar
Metaheuristics for Group Shop Scheduling
M. Sampels, C. Blum, M. Mastrolilli, Olivia Rossi-Doria
2002Parallel Problem Solving from Nature23 citations
Semantic Scholar
(Acyclic) Job Shops are Hard to Approximate
M. Mastrolilli, O. Svensson
20082008 49th Annual IEEE Symposium on Foundations of Computer Science22 citations Open access
Semantic Scholar
RESOURCE ALLOCATION AND SCHEDULING OF OPERATIONS IN AN INTERMODAL TERMINAL
Marco Zaffalon, A. Rizzoli, L. Gambardella, M. Mastrolilli +1 more
199822 citations
Semantic Scholar
Scheduling with Precedence Constraints of Low Fractional Dimension
Christoph Ambuhl, M. Mastrolilli, Nikolaus Mutsanas, O. Svensson
2007Conference on Integer Programming and Combinatorial Optimization19 citations Open access
Semantic Scholar
SIMULATION FOR POLICY EVALUATION , PLANNING AND DECISION SUPPORT IN AN INTERMODAL CONTAINER TERMINAL
M. Mastrolilli, Nicoletta Fornara, Maria Luca, Andrea E. Gambardella +2 more
199818 citations
Semantic Scholar
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Christoph Ambuhl, M. Mastrolilli, O. Svensson
2006International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques17 citations Open access
Semantic Scholar
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
M. Mastrolilli
2019ACM-SIAM Symposium on Discrete Algorithms16 citations Open access
Semantic Scholar
Constrained Matching Problems in Bipartite Graphs
M. Mastrolilli, G. Stamoulis
2012International Symposium on Combinatorial Optimization16 citations
Semantic Scholar
Tight Sum-of-squares Lower Bounds for Binary Polynomial Optimization Problems
Adam Kurpisz, Samuli Leppänen, M. Mastrolilli
2016International Colloquium on Automata, Languages and Programming15 citations Open access
Semantic Scholar
Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms
M. Mastrolilli
2003International Journal of Foundations of Computer Science15 citations
Semantic Scholar
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
Eleonora Vercesi, Stefano Gualandi, M. Mastrolilli, L. Gambardella
2021Mathematical Programming Computation14 citations Open access
Semantic Scholar
Approximating Single Machine Scheduling with Scenarios
M. Mastrolilli, Nikolaus Mutsanas, O. Svensson
2008International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques14 citations Open access
Semantic Scholar
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
Adam Kurpisz, Samuli Leppänen, M. Mastrolilli
2017Mathematical programming12 citations Open access
Semantic Scholar
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts
M. Mastrolilli
2017Conference on Integer Programming and Combinatorial Optimization12 citations
Semantic Scholar
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem
N. Boria, Adam Kurpisz, Samuli Leppänen, M. Mastrolilli
2014Workshop on Algorithms in Bioinformatics12 citations
Semantic Scholar
Bi-criteria and approximation algorithms for restricted matchings
M. Mastrolilli, G. Stamoulis
2013Theoretical Computer Science12 citations Open access
Semantic Scholar
Vertex cover in graphs with locally few colors
F. Kuhn, M. Mastrolilli
2011Information and Computation12 citations Open access
Semantic Scholar
Improved Bounds for Flow Shop Scheduling
M. Mastrolilli, O. Svensson
2009International Colloquium on Automata, Languages and Programming11 citations Open access
Semantic Scholar
Approximation schemes for parallel machine scheduling problems with controllable processing times
Klaus Jansen, M. Mastrolilli
2004Computers & Operations Research11 citations
Semantic Scholar
Semidefinite and linear programming integrality gaps for scheduling identical machines
Adam Kurpisz, M. Mastrolilli, Claire Mathieu, Tobias Mömke +2 more
2016Mathematical programming10 citations Open access
Semantic Scholar
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders
Christoph Ambuhl, M. Mastrolilli, Nikolaus Mutsanas, O. Svensson
2008Bull. EATCS9 citations
Semantic Scholar
Notes on Max Flow Time Minimization with Controllable Processing Times
M. Mastrolilli
2003Computing9 citations Open access
Semantic Scholar
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Christoph Ambuhl, M. Mastrolilli
2006Embedded Systems and Applications8 citations
Semantic Scholar