Polynomial programming prevents aircraft (and other) conflicts - Archive ouverte HAL Access content directly
Journal Articles Operations Research Letters Year : 2021

Polynomial programming prevents aircraft (and other) conflicts

Leo Liberti

Abstract

Using a known algebraic result, we obtain a finite (if nonconvex) polynomial programming reformulation of a semi-infinite program modeling the aircraft deconfliction problem via subliminal speed regulation. Solving the reformulation often yields better results than the state of the art.
Fichier principal
Vignette du fichier
SOS.pdf (241.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02971109 , version 1 (19-10-2020)
hal-02971109 , version 2 (12-02-2021)

Identifiers

Cite

Martina Cerulli, Leo Liberti. Polynomial programming prevents aircraft (and other) conflicts. Operations Research Letters, 2021, ⟨10.1016/j.orl.2021.05.001⟩. ⟨hal-02971109v2⟩
102 View
245 Download

Altmetric

Share

Gmail Facebook X LinkedIn More