Polynomial programming prevents aircraft (and other) conflicts

DOI10.1016/j.orl.2021.05.001OpenAlexW3157894372MaRDI QIDQ2060568

Martina Cerulli, Leo Liberti

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.05.001

zbMATH Keywords

quadratic programmingsemi-infinite programmingdistance constraintaircraft deconfliction

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items (1)

Robust aircraft conflict resolution under trajectory prediction uncertainty

Cites Work

• Unnamed Item
• Feasibility pump for aircraft deconfliction with speed regulation
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Flying safely by bilevel programming
• Detecting and solving aircraft conflicts using bilevel programming
• Aircraft deconfliction with speed regulation: new models from mixed-integer optimization
• Semidefinite relaxations for semi-infinite polynomial programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Solving air traffic conflict problems via local continuous optimization
• The Cutting-Plane Method for Solving Convex Programs
• Branching and bounds tighteningtechniques for non-convex MINLP
• An implementation of a discretization method for semi-infinite programming
• On solving a class of linear semi-infinite programming by SDP method
• Kinetic Euclidean Distance Matrices

This page was built for publication: Polynomial programming prevents aircraft (and other) conflicts