Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Cerulli, Martina"'
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 as colorful if each color appears at most once. The problems differ in
Externí odkaz:
http://arxiv.org/abs/2408.16508
Autor:
Pelegrin, Mercedes, Cerulli, Martina
Publikováno v:
INFORMS Journal on Computing, Volume 35, Number 2, Pages 274-285 (2023)
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 proposed to assist trajectory regulation to avoid conflicts. However,
Externí odkaz:
http://arxiv.org/abs/2405.12836
The Minimum Spanning Tree Problem with Conflicts consists in finding the minimum conflict-free spanning tree of a graph, i.e., the spanning tree of minimum cost, including no pairs of edges that are in conflict. In this paper, we solve this problem u
Externí odkaz:
http://arxiv.org/abs/2401.02222
Autor:
Oustry, Antoine, Cerulli, Martina
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 hard. We propose to tackle this difficulty by solving the separation pro
Externí odkaz:
http://arxiv.org/abs/2307.14181
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. Since the carriers are not under the platform's control, the platform has
Externí odkaz:
http://arxiv.org/abs/2304.09170
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 evaluate the cohesiveness of a community. We address the Collapsed k-Co
Externí odkaz:
http://arxiv.org/abs/2211.14833
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, we focus on solving doubly nonnegative programs (DNN), which are semi
Externí odkaz:
http://arxiv.org/abs/1912.09851
Publikováno v:
In European Journal of Operational Research 16 November 2023 311(1):56-72
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.