1.1k citations
- École PolytechniqueFR461 papers
- Centre National de la Recherche ScientifiqueFR295 papers
- Institut national de recherche en sciences et technologies du numériqueFR118 papers
- Centre Inria de SaclayFR62 papers
- Institut Polytechnique de ParisFR60 papers
- CRANFR28 papers
- Université Paris CitéFR28 papers
- Université Paris-SaclayFR26 papers
- Sorbonne UniversitéFR25 papers
- Université de LorraineFR18 papers
- Université Paris-SudFR17 papers
- École Normale Supérieure de LyonFR14 papers
31 papers · 1 filter
Distance geometry with and without the graph
Leo Liberti, Carlile Lavor
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as p…
A comparison of formulations for aircraft deconfliction
Renan Spencer Trindade, Claudia D'Ambrosio
In this work, we aim to compare different methods and formulations to solve a problem in air traffic management to global optimality. In particular, we focus on the aircraft deconf…
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…
Learning to Configure Mathematical Programming Solvers by Mathematical Programming
Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni +1
We discuss the issue of finding a good mathematical programming solver configuration for a particular instance of a given problem, and we propose a two-phase approach to solve it.…
Minimal-time nonlinear control via semi-infinite programming
Antoine Oustry, Matteo Tacchi
We address the problem of computing a control for a time-dependent nonlinear system to reach a target set in a minimal time. To solve this minimal time control problem, we introduc…
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…