Improving ADMMs for solving doubly nonnegative programs through dual factorization. - Martina Cerulli; Marianna De Santis; Elisabeth Gaar; Angelika Wiegele (4OR, 2021)

Detecting and solving aircraft conflicts using bilevel programming. - Martina Cerulli; Claudia D'Ambrosio; Leo Liberti; Mercedes Pelegrín (J. Glob. Optim., 2021)

Polynomial programming prevents aircraft (and other) conflicts. - Martina Cerulli; Leo Liberti (Oper. Res. Lett., 2021)

Bilevel optimization and applications. (Optimisation biniveau et applications). - Martina Cerulli (2021)

Convergent Algorithms for a Class of Convex Semi-infinite Programs. - Martina Cerulli; Antoine Oustry; Claudia D'Ambrosio; Leo Liberti (SIAM J. Optim., 2022)

Aircraft Conflict Resolution: A Benchmark Generator. - Mercedes Pelegrín; Martina Cerulli (INFORMS J. Comput., 2023)

Mathematical programming formulations for the Collapsed k-Core Problem. - Martina Cerulli; Domenico Serra; Carmine Sorgente; Claudia Archetti; Ivana Ljubic (Eur. J. Oper. Res., 2023)

Kernel Search approach to solve the Minimum Spanning Tree Problem with conflicting edge pairs. - Francesco Carrabs; Martina Cerulli; Domenico Serra (CoRR, 2024)

Branch-and-cut algorithms for colorful components problems. - Claudia Archetti; Martina Cerulli; Carmine Sorgente (CoRR, 2024)

A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery. - Martina Cerulli; Claudia Archetti; Elena Fernández 001; Ivana Ljubic (Transp. Sci., 2024)

Preventing Disinformation Spread Across Network Clusters by Strategic Edge Deletions: a Lagrangian Heuristic. - Martina Cerulli; Manlio Gaudioso; Domenico Serra; Carmine Sorgente (ITASEC/SERICS, 2025)

Convex semi-infinite programming algorithms with inexact separation oracles. - Antoine Oustry; Martina Cerulli (Optim. Lett., 2025)