Monaldo Mastrolilli

110 papers A* 8A 6B 13C 5Misc 1Journal 63Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes. ICALP Koppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi
2025	J	`jnl`	Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes. CoRR Koppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi
2025	J	`jnl`	Computational Complexity of Sum-of-Squares Bounds for Copositive Programs. SIAM J. Optim. Marilena Palomba, Lucas Slot, Luis Felipe Vargas, Monaldo Mastrolilli
2025	J	`jnl`	Computational complexity of sum-of-squares bounds for copositive programs. CoRR Marilena Palomba, Lucas Slot, Luis Felipe Vargas, Monaldo Mastrolilli
2025	J	`jnl`	Ideal Membership Problem for Boolean Minority and Dual Discriminator. SIAM J. Discret. Math. Arpitha P. Bharathi, Monaldo Mastrolilli
2025	J	`jnl`	On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations. CoRR Alex Bortolotti, Monaldo Mastrolilli, Marilena Palomba, Luis Felipe Vargas
2025	A*	`conf`	On the Degree Automatability of Sum-Of-Squares Proofs. ICALP Alex Bortolotti, Monaldo Mastrolilli, Luis Felipe Vargas
2025	J	`jnl`	On the Degree Automatability of Sum-of-Squares Proofs. CoRR Alex Bortolotti, Monaldo Mastrolilli, Luis Felipe Vargas
2025	J	`jnl`	On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach. CoRR Eleonora Vercesi, János Barta, Luca Maria Gambardella, Stefano Gualandi, Monaldo Mastrolilli
2025	J	`jnl`	On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach. Discret. Optim. Eleonora Vercesi, János Barta, Luca Maria Gambardella, Stefano Gualandi, Monaldo Mastrolilli
2025	J	`jnl`	The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components. CoRR Tullio Villa, Eleonora Vercesi, János Barta, Monaldo Mastrolilli
2024	J	`jnl`	Ideal Membership Problem for Boolean Minority and Dual Discriminator. CoRR Arpitha P. Bharathi, Monaldo Mastrolilli
2024	J	`jnl`	On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation. CoRR Ambrogio Maria Bernardelli, Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella
2024	J	`jnl`	Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2023	J	`jnl`	On the generation of metric TSP instances with a large integrality gap by branch-and-cut. Math. Program. Comput. Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella
2022	J	`jnl`	Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism. SIAM J. Discret. Math. Arpitha P. Bharathi, Monaldo Mastrolilli
2022	J	`jnl`	On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg
2021	B	`conf`	Ideal Membership Problem for Boolean Minority and Dual Discriminator. MFCS Arpitha P. Bharathi, Monaldo Mastrolilli
2021	J	`jnl`	The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. ACM Trans. Algorithms Monaldo Mastrolilli
2020	J	`jnl`	High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy, and Chvátal-Gomory Cuts. SIAM J. Optim. Monaldo Mastrolilli
2020	B	`conf`	Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. MFCS Arpitha P. Bharathi, Monaldo Mastrolilli
2020	J	`jnl`	Ideal Membership Problem for Boolean Minority. CoRR Arpitha P. Bharathi, Monaldo Mastrolilli
2020	J	`jnl`	Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2019	J	`jnl`	The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain. CoRR Monaldo Mastrolilli
2019	A*	`conf`	The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. SODA Monaldo Mastrolilli
2018	C	`conf`	On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
2018	J	`jnl`	On bounded pitch inequalities for the min-knapsack polytope. CoRR Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
2018	J	`jnl`	Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2018	J	`jnl`	Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2017	J	`jnl`	An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2017	B	`ed.`	Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers WAOA Klaus Jansen, Monaldo Mastrolilli
2017	B	`conf`	High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts. IPCO Monaldo Mastrolilli
2017	J	`jnl`	High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts. Electron. Colloquium Comput. Complex. Monaldo Mastrolilli
2017	J	`jnl`	High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts. CoRR Monaldo Mastrolilli
2017	J	`jnl`	On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	B	`conf`	Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2016	B	`conf`	Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	C	`conf`	Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	J	`jnl`	Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	A*	`conf`	Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2016	J	`jnl`	Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	A	`conf`	A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	J	`jnl`	A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	—	`conf`	On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2015	J	`jnl`	On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2014	J	`jnl`	Bi-criteria and approximation algorithms for restricted matchings. Theor. Comput. Sci. Monaldo Mastrolilli, Georgios Stamoulis
2014	C	`conf`	Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2014	J	`jnl`	On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
2014	J	`jnl`	The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. Algorithmica Monaldo Mastrolilli
2013	J	`jnl`	Bi-Criteria and Approximation Algorithms for Restricted Matchings. CoRR Monaldo Mastrolilli, Georgios Stamoulis
2013	A*	`conf`	How to Sell Hyperedges: The Hypermatching Assignment Problem. SODA Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli
2013	J	`jnl`	Lasserre Integrality Gaps for Certain Capacitated Covering Problems. CoRR Monaldo Mastrolilli
2013	J	`jnl`	On the approximation of minimum cost homomorphism to bipartite graphs. Discret. Appl. Math. Monaldo Mastrolilli, Arash Rafiey
2013	J	`jnl`	Single machine scheduling with scenarios. Theor. Comput. Sci. Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2013	J	`jnl`	Vertex cover in graphs with locally few colors. Inf. Comput. Fabian Kuhn, Monaldo Mastrolilli
2012	A	`conf`	Approximation of Minimum Cost Homomorphisms. ESA Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey
2012	B	`conf`	Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis
2012	C	`conf`	Constrained Matching Problems in Bipartite Graphs. ISCO Monaldo Mastrolilli, Georgios Stamoulis
2012	Misc	`conf`	Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. COCOON Monaldo Mastrolilli, Georgios Stamoulis
2012	B	`conf`	The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. LATIN Monaldo Mastrolilli
2011	J	`jnl`	Hardness of Approximating Flow and Job Shop Scheduling Problems. J. ACM Monaldo Mastrolilli, Ola Svensson
2011	J	`jnl`	Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput. Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2011	J	`jnl`	On the Approximability of Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2011	J	`jnl`	The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem CoRR Monaldo Mastrolilli
2011	—	`conf`	Vertex Cover in Graphs with Locally Few Colors. ICALP (1) Fabian Kuhn, Monaldo Mastrolilli
2010	J	`jnl`	Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan
2010	J	`jnl`	On the use of different types of knowledge in metaheuristics based on constructing solutions. Eng. Appl. Artif. Intell. Monaldo Mastrolilli, Christian Blum
2009	—	`conf`	Improved Bounds for Flow Shop Scheduling. ICALP (1) Monaldo Mastrolilli, Ola Svensson
2009	J	`jnl`	Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. Algorithmica Christoph Ambühl, Monaldo Mastrolilli
2008	A*	`conf`	(Acyclic) JobShops are Hard to Approximate. FOCS Monaldo Mastrolilli, Ola Svensson
2008	—	`conf`	Approximating Single Machine Scheduling with Scenarios. APPROX-RANDOM Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2008	J	`jnl`	Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2008	—	`ch.`	Hybridizations of Metaheuristics With Branch & Bound Derivates. Hybrid Metaheuristics Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Monaldo Mastrolilli
2008	J	`jnl`	Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Bull. EATCS Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2007	A*	`conf`	Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2007	B	`conf`	Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2007	J	`jnl`	The Robust Traveling Salesman Problem with Interval Data. Transp. Sci. Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella
2007	—	`conf`	Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. Hybrid Metaheuristics Christian Blum, Monaldo Mastrolilli
2006	J	`jnl`	A linear time approximation scheme for the single machine scheduling problem with controllable processing times. J. Algorithms Monaldo Mastrolilli
2006	—	`conf`	Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2006	J	`jnl`	Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. J. Math. Model. Algorithms Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto
2006	J	`jnl`	Hybrid rounding techniques for knapsack problems. Discret. Appl. Math. Monaldo Mastrolilli, Marcus Hutter
2006	A	`conf`	Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. ESA Christoph Ambühl, Monaldo Mastrolilli
2005	J	`jnl`	Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005	J	`jnl`	Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005	J	`jnl`	Core instances for testing: A case study. Eur. J. Oper. Res. Monaldo Mastrolilli, Leonora Bianchi
2005	J	`jnl`	Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? Eur. J. Oper. Res. Monaldo Mastrolilli, Luca Maria Gambardella
2005	J	`jnl`	On-line scheduling to minimize max flow time: an optimal preemptive algorithm. Oper. Res. Lett. Christoph Ambühl, Monaldo Mastrolilli
2004	A	`conf`	Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. PPSN Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto
2004	J	`jnl`	Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. Klaus Jansen, Monaldo Mastrolilli
2004	A*	`conf`	MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? AAAI Monaldo Mastrolilli, Luca Maria Gambardella
2004	J	`jnl`	Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. Int. J. Found. Comput. Sci. Monaldo Mastrolilli
2003	—	`conf`	Core Instances for Testing: A Case Study. WEA Monaldo Mastrolilli, Leonora Bianchi
2003	J	`jnl`	Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. J. Sched. Monaldo Mastrolilli
2003	—	`ed.`	Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings WEA Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim
2003	J	`jnl`	Hybrid Rounding Techniques for Knapsack Problems CoRR Monaldo Mastrolilli, Marcus Hutter
2003	J	`jnl`	Notes on Max Flow Time Minimization with Controllable Processing Times. Computing Monaldo Mastrolilli
2003	B	`conf`	On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2003	B	`conf`	Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. FCT Monaldo Mastrolilli
2002	C	`conf`	A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT 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
2002	—	`conf`	A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. SWAT Monaldo Mastrolilli
2002	—	`—`	Approximation schemes for scheduling problems. Monaldo Mastrolilli
2002	A	`conf`	Metaheuristics for Group Shop Scheduling. PPSN Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria
2001	J	`jnl`	An optimization methodology for intermodal terminal management. J. Intell. Manuf. Luca Maria Gambardella, Monaldo Mastrolilli, Andrea Emilio Rizzoli, Marco Zaffalon
2001	B	`conf`	Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. FCT Monaldo Mastrolilli
2001	—	`conf`	Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. FSTTCS Monaldo Mastrolilli
2001	A	`conf`	Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2001	—	`conf`	Job Shop Scheduling Problems with Controllable Processing Times. ICTCS Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2000	B	`conf`	Approximation Algorithms for Flexible Job Shop Problems. LATIN Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2000	—	`conf`	Parallel Machine Scheduling Problems with Controllable Processing Times. ICALP Satellite Workshops Klaus Jansen, Monaldo Mastrolilli