Graph coloring for air traffic flow management
From MaRDI portal
Publication:1876533
DOI10.1023/B:ANOR.0000032574.01332.98zbMath1062.90011MaRDI QIDQ1876533
Nicolas Barnier, Pascal Brisset
Publication date: 20 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
greedy algorithm; graph coloring; cliques; constraint programming; air traffic flow management; route network
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B20: Traffic problems in operations research
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling, A multiobjective distance separation methodology to determine sector-level minimum separation for safe air traffic scenarios, A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems, Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate, Graph coloring by multiagent fusion search, A search space ``cartography for guiding graph coloring heuristics, Simple decentralized graph coloring, Runway sequencing with holding patterns, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
