Monaldo Mastrolilli

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 28

Top Venues

University of Kiel (PHD)

Education History

University of Kiel

PHD

Publications

Ambrogio Maria Bernardelli, Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella
On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation. CoRR (2024)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory 16 (1) (2024)
Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella
On the generation of metric TSP instances with a large integrality gap by branch-and-cut. Math. Program. Comput. 15 (2) (2023)
Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg
On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. 44 (Part) (2022)
Arpitha P. Bharathi, Monaldo Mastrolilli
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism. SIAM J. Discret. Math. 36 (3) (2022)
Arpitha P. Bharathi, Monaldo Mastrolilli
Ideal Membership Problem for Boolean Minority and Dual Discriminator. MFCS (2021)
Monaldo Mastrolilli
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. ACM Trans. Algorithms 17 (4) (2021)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. 182 (1) (2020)
Arpitha P. Bharathi, Monaldo Mastrolilli
Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. MFCS (2020)
Arpitha P. Bharathi, Monaldo Mastrolilli
Ideal Membership Problem for Boolean Minority. CoRR (2020)
Monaldo Mastrolilli
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy, and Chvátal-Gomory Cuts. SIAM J. Optim. 30 (1) (2020)
Monaldo Mastrolilli
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. SODA (2019)
Monaldo Mastrolilli
The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain. CoRR (2019)
Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
On bounded pitch inequalities for the min-knapsack polytope. CoRR (2018)
Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO (2018)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. 36 (3) (2018)
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172 (1-2) (2018)
Monaldo Mastrolilli
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts. CoRR (2017)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. 42 (1) (2017)
Monaldo Mastrolilli
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts. IPCO (2017)
Monaldo Mastrolilli
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts. Electron. Colloquium Comput. Complex. 24 (2017)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. 166 (1-2) (2017)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO (2016)
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. 23 (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR (2015)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) (2015)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR (2015)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA (2015)
Monaldo Mastrolilli
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. Algorithmica 70 (2) (2014)
Monaldo Mastrolilli, Georgios Stamoulis
Bi-criteria and approximation algorithms for restricted matchings. Theor. Comput. Sci. 540 (2014)
Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI (2014)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR (2014)
Monaldo Mastrolilli
Lasserre Integrality Gaps for Certain Capacitated Covering Problems. CoRR (2013)
Monaldo Mastrolilli, Arash Rafiey
On the approximation of minimum cost homomorphism to bipartite graphs. Discret. Appl. Math. 161 (4-5) (2013)
Monaldo Mastrolilli, Georgios Stamoulis
Bi-Criteria and Approximation Algorithms for Restricted Matchings. CoRR (2013)
Fabian Kuhn, Monaldo Mastrolilli
Vertex cover in graphs with locally few colors. Inf. Comput. 222 (2013)
Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli
How to Sell Hyperedges: The Hypermatching Assignment Problem. SODA (2013)
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
Single machine scheduling with scenarios. Theor. Comput. Sci. 477 (2013)
Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA (2012)
Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey
Approximation of Minimum Cost Homomorphisms. ESA (2012)
Monaldo Mastrolilli, Georgios Stamoulis
Constrained Matching Problems in Bipartite Graphs. ISCO (2012)
Monaldo Mastrolilli, Georgios Stamoulis
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. COCOON (2012)
Monaldo Mastrolilli
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. LATIN (2012)
Monaldo Mastrolilli, Ola Svensson
Hardness of Approximating Flow and Job Shop Scheduling Problems. J. ACM 58 (5) (2011)
Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput. 40 (2) (2011)
Monaldo Mastrolilli
The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem CoRR (2011)
Fabian Kuhn, Monaldo Mastrolilli
Vertex Cover in Graphs with Locally Few Colors. ICALP (1) (2011)
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
On the Approximability of Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 36 (4) (2011)
Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan
Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38 (5) (2010)
Monaldo Mastrolilli, Christian Blum
On the use of different types of knowledge in metaheuristics based on constructing solutions. Eng. Appl. Artif. Intell. 23 (5) (2010)
Christoph Ambühl, Monaldo Mastrolilli
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. Algorithmica 53 (4) (2009)
Monaldo Mastrolilli, Ola Svensson
Improved Bounds for Flow Shop Scheduling. ICALP (1) (2009)
Monaldo Mastrolilli, Ola Svensson
(Acyclic) JobShops are Hard to Approximate. FOCS (2008)
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
Approximating Single Machine Scheduling with Scenarios. APPROX-RANDOM (2008)
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Bull. EATCS 95 (2008)
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica 51 (2) (2008)
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO (2007)
Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS (2007)
Christian Blum, Monaldo Mastrolilli
Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. Hybrid Metaheuristics (2007)
Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella
The Robust Traveling Salesman Problem with Interval Data. Transp. Sci. 41 (3) (2007)
Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM (2006)
Monaldo Mastrolilli, Marcus Hutter
Hybrid rounding techniques for knapsack problems. Discret. Appl. Math. 154 (4) (2006)
Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. J. Math. Model. Algorithms 5 (1) (2006)
Monaldo Mastrolilli
A linear time approximation scheme for the single machine scheduling problem with controllable processing times. J. Algorithms 59 (1) (2006)
Christoph Ambühl, Monaldo Mastrolilli
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. ESA (2006)
Monaldo Mastrolilli, Leonora Bianchi
Core instances for testing: A case study. Eur. J. Oper. Res. 166 (1) (2005)
Christoph Ambühl, Monaldo Mastrolilli
On-line scheduling to minimize max flow time: an optimal preemptive algorithm. Oper. Res. Lett. 33 (6) (2005)
Monaldo Mastrolilli, Luca Maria Gambardella
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? Eur. J. Oper. Res. 166 (1) (2005)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. 167 (2) (2005)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. 16 (2) (2005)
Klaus Jansen, Monaldo Mastrolilli
Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. 31 (10) (2004)
Monaldo Mastrolilli, Luca Maria Gambardella
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? AAAI (2004)
Monaldo Mastrolilli
Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. Int. J. Found. Comput. Sci. 15 (2) (2004)
Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto
Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. PPSN (2004)
Monaldo Mastrolilli, Leonora Bianchi
Core Instances for Testing: A Case Study. WEA (2003)
Monaldo Mastrolilli
Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. J. Sched. 6 (6) (2003)
Monaldo Mastrolilli
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. FCT (2003)
Monaldo Mastrolilli
Notes on Max Flow Time Minimization with Controllable Processing Times. Computing 71 (4) (2003)
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC (2003)
Monaldo Mastrolilli, Marcus Hutter
Hybrid Rounding Techniques for Knapsack Problems CoRR (2003)
Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria
Metaheuristics for Group Shop Scheduling. PPSN (2002)
Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luís Paquete, Thomas Stützle
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT (2002)
Monaldo Mastrolilli
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. SWAT (2002)
Monaldo Mastrolilli
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. FSTTCS (2001)
Luca Maria Gambardella, Monaldo Mastrolilli, Andrea Emilio Rizzoli, Marco Zaffalon
An optimization methodology for intermodal terminal management. J. Intell. Manuf. 12 (5-6) (2001)
Monaldo Mastrolilli
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. FCT (2001)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Job Shop Scheduling Problems with Controllable Processing Times. ICTCS (2001)
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA (2001)
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
Approximation Algorithms for Flexible Job Shop Problems. LATIN (2000)
Klaus Jansen, Monaldo Mastrolilli
Parallel Machine Scheduling Problems with Controllable Processing Times. ICALP Satellite Workshops (2000)

Monaldo Mastrolilli.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Monaldo Mastrolilli