Polynomial programming prevents aircraft (and other) conflicts

Martina Cerulli; Leo Liberti

doi:10.1016/j.orl.2021.05.001

Polynomial programming prevents aircraft (and other) conflicts

Martina Cerulli
, Leo Liberti

Laboratoire d'Informatique (LIX)

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	447-451
Number of pages	5
Journal	Operations Research Letters
Volume	49
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2021.05.001
Publication status	Published - 1 Jul 2021

Keywords

Aircraft deconfliction
Distance constraint
Quadratic programming
Semi-infinite programming

Access to Document

10.1016/j.orl.2021.05.001

Cite this

@article{6279c5af322c449086a442bdf16dc90e,

title = "Polynomial programming prevents aircraft (and other) conflicts",

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.",

keywords = "Aircraft deconfliction, Distance constraint, Quadratic programming, Semi-infinite programming",

author = "Martina Cerulli and Leo Liberti",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = jul,

day = "1",

doi = "10.1016/j.orl.2021.05.001",

language = "English",

volume = "49",

pages = "447--451",

journal = "Operations Research Letters",

issn = "0167-6377",

number = "4",

}

TY - JOUR

T1 - Polynomial programming prevents aircraft (and other) conflicts

AU - Cerulli, Martina

AU - Liberti, Leo

PY - 2021/7/1

Y1 - 2021/7/1

N2 - 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.

AB - 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.

KW - Aircraft deconfliction

KW - Distance constraint

KW - Quadratic programming

KW - Semi-infinite programming

U2 - 10.1016/j.orl.2021.05.001

DO - 10.1016/j.orl.2021.05.001

M3 - Article

AN - SCOPUS:85105605344

SN - 0167-6377

VL - 49

SP - 447

EP - 451

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

Polynomial programming prevents aircraft (and other) conflicts

Abstract

Keywords

Access to Document

Fingerprint

Cite this