Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate

DOI10.1016/J.EJOR.2010.04.020zbMATH Open1205.90082OpenAlexW1993950653MaRDI QIDQ992595FDOQ992595

Authors: S. Constans, Rémy Fondacci, Damien Prot, Christophe Rapine 

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.04.020

Recommendations

• Graph coloring for air traffic flow management
• A 4D-sequencing approach for air traffic management
• A combinatorial model to optimize air traffic flow management problems
• Combinatorial issues in air traffic optimization
• A new variant of the minimum-weight maximum-cardinality clique problem to solve conflicts between aircraft

zbMATH Keywords

graph theorytransportationair traffic management

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites Work

• Intersection graphs of segments
• Triangle-Free Planar Graphs and Segment Intersection Graphs
• Graph coloring for air traffic flow management
• Intersection graphs of curves in the plane
• Combinatorial issues in air traffic optimization
• Classes and recognition of curve contact graphs

Cited In (4)

• A probabilistic measure of air traffic complexity in 3-D airspace
• Combinatorial issues in air traffic optimization
• Graph coloring for air traffic flow management
• A 4D-sequencing approach for air traffic management

This page was built for publication: Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992595)