Using a known algebraic result, we obtain a finite polynomial programming reformulation of a semi-infinite program modeling the aircraft deconfliction problem via subliminal speed regulation. Solving the reformulation yields better results than the state of the art for most of the tested instances.
Polynomial programming prevents aircraft (and other) conflicts
Cerulli M.;
2021-01-01
Abstract
Using a known algebraic result, we obtain a finite polynomial programming reformulation of a semi-infinite program modeling the aircraft deconfliction problem via subliminal speed regulation. Solving the reformulation yields better results than the state of the art for most of the tested instances.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
