![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Monaldo Mastrolilli
University of Applied Sciences and Arts of Southern Switzerland, Switzerland
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 98 matches
- 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): 3:1-3:16 (2024) - 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 abs/2405.13773 (2024) - 2023
- 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): 389-416 (2023) - 2022
- 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): 100567 (2022) - Arpitha P. Bharathi, Monaldo Mastrolilli:
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism. SIAM J. Discret. Math. 36(3): 1800-1822 (2022) - 2021
- Monaldo Mastrolilli:
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. ACM Trans. Algorithms 17(4): 32:1-32:29 (2021) - Arpitha P. Bharathi, Monaldo Mastrolilli:
Ideal Membership Problem for Boolean Minority and Dual Discriminator. MFCS 2021: 16:1-16:20 - 2020
- Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. 182(1): 369-397 (2020) - Monaldo Mastrolilli:
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy, and Chvátal-Gomory Cuts. SIAM J. Optim. 30(1): 798-822 (2020) - Arpitha P. Bharathi, Monaldo Mastrolilli:
Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. MFCS 2020: 13:1-13:13 - Arpitha P. Bharathi, Monaldo Mastrolilli:
Ideal Membership Problem for Boolean Minority. CoRR abs/2006.16422 (2020) - 2019
- Monaldo Mastrolilli:
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. SODA 2019: 456-475 - Monaldo Mastrolilli:
The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain. CoRR abs/1904.04072 (2019) - 2018
- Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. 36(3): 831-844 (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): 231-248 (2018) - Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli
, Ola Svensson:
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO 2018: 170-182 - Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On bounded pitch inequalities for the min-knapsack polytope. CoRR abs/1801.08850 (2018) - 2017
- Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. 42(1): 135-143 (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): 1-17 (2017) - Monaldo Mastrolilli
:
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts. IPCO 2017: 405-416 - Klaus Jansen, Monaldo Mastrolilli:
Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10138, Springer 2017, ISBN 978-3-319-51740-7 [contents] - Monaldo Mastrolilli:
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts. CoRR abs/1709.07966 (2017) - Monaldo Mastrolilli:
High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvatal-Gomory cuts. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP 2016: 78:1-78:14 - Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO 2016: 362-374 - 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: 152-163 - Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO 2016: 403-413 - Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR abs/1605.03019 (2016) - Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- Adam Kurpisz
, Samuli Leppänen, Monaldo Mastrolilli
:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA 2015: 853-864
skipping 68 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-27 05:23 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint