13 citations · 31 across the 6 of their papers we have counts for
6 papers
Branch-and-cut algorithms for colorful components problems
Claudia Archetti, Martina Cerulli, Carmine Sorgente
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined…
Aircraft Conflict Resolution: A Benchmark Generator
Mercedes Pelegrin, Martina Cerulli
Aircraft conflict resolution is one of the major tasks of computer-aided air traffic management and represents a challenging optimization problem. Many models and methods have been…
Convex semi-infinite programming algorithms with inexact separation oracles
Antoine Oustry, Martina Cerulli
Solving convex Semi-Infinite Programming (SIP) problems is challenging when the separation problem, i.e., the problem of finding the most violated constraint, is computationally ha…
A bilevel approach for compensation and routing decisions in last-mile delivery
Martina Cerulli, Claudia Archetti, Elena Fernandez +1
In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connecting senders, customers, and independent carriers to fulfill delivery requests. Sin…
Mathematical Programming Formulations for the Collapsed k-Core Problem
Martina Cerulli, Domenico Serra, Carmine Sorgente +2
In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k, is frequently adopted as a typical metric to e…
Improving ADMMs for Solving Doubly Nonnegative Programs through Dual Factorization
Martina Cerulli, Marianna De Santis, Elisabeth Gaar +1
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper,…