( en | de | ru )

 

Disambiguation of "Mastrolilli, Monaldo"

Author of the publication

copydeleteadd this publication to your clipboard
Sum-of-squares hierarchy lower bounds for symmetric formulations.

, , and . Math. Program., 182 (1): 369-397 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Monaldo Mastrolilli

Palmo Monaldo Mastrolilli

 

Other publications of authors with the same name

Sum-of-squares hierarchy lower bounds for symmetric formulations., , and . Math. Program., 182 (1): 369-397 (2020)Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge., and . Hybrid Metaheuristics, volume 4771 of Lecture Notes in Computer Science, page 123-139. Springer, (2007)Parallel Machine Scheduling Problems with Controllable Processing Times., and . ICALP Satellite Workshops, page 179-190. Carleton Scientific, Waterloo, Ontario, Canada, (2000)Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands., , , , , , , and . PPSN, volume 3242 of Lecture Notes in Computer Science, page 450-460. Springer, (2004)Ideal Membership Problem for Boolean Minority and Dual Discriminator., and . MFCS, volume 202 of LIPIcs, page 16:1-16:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation., , , , and . CoRR, (2024)The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain.. SODA, page 456-475. SIAM, (2019)Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain., and . MFCS, volume 170 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut, , and . SIAM J. Comput., 40 (2): 567-596 (2011)The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain.. CoRR, (2019)