On the complexity of binary polynomial optimization over acyclic hypergraphs A Del Pia, S Di Gregorio Algorithmica 85 (8), 2189-2213, 2023 | 23 | 2023 |
Chvátal rank in binary polynomial optimization A Del Pia, S Di Gregorio INFORMS Journal on Optimization 3 (4), 315-349, 2021 | 21 | 2021 |
A polyhedral study of lifted multicuts B Andres, S Di Gregorio, J Irmai, JH Lange Discrete Optimization 47, 100757, 2023 | 6 | 2023 |
A knowledge compilation take on binary polynomial optimization F Capelli, A Del Pia, S Di Gregorio arXiv preprint arXiv:2311.00149, 2023 | 2 | 2023 |
Partial optimality in cubic correlation clustering D Stein, S Di Gregorio, B Andres International Conference on Machine Learning, 32598-32617, 2023 | 2 | 2023 |
A polyhedral study of lifted multicuts (vol 47, 100757, 2023) B Andres, S Di Gregorio, J Irmai, JH Lange DISCRETE OPTIMIZATION 55, 2025 | | 2025 |
Corrigendum to “A polyhedral study of lifted multicuts”[Discrete Optim. 47 (2023) 100757] B Andres, S Di Gregorio, J Irmai, JH Lange Discrete Optimization 55, 100876, 2025 | | 2025 |
Exploiting hypergraphs’ properties in binary polynomial optimization S Di Gregorio The University of Wisconsin-Madison, 2020 | | 2020 |