What is it about?
The paper proposes a linear-programming based solution for solving sectorization problem for Terminal Maneuvering Areas (TMAs). The resulting sectors are operationally feasible and convex.
Featured Image
Read the Original
This page is a summary of: Integer Programming–Based Airspace Sectorization for Terminal Maneuvering Areas with Convex Sectors, Journal of Air Transportation, October 2019, American Institute of Aeronautics and Astronautics (AIAA),
DOI: 10.2514/1.d0148.
You can read the full text:
Contributors
The following have contributed to this page
