Graph coloring for air traffic flow management

DOI10.1023/B:ANOR.0000032574.01332.98zbMath1062.90011MaRDI QIDQ1876533

Pascal Brisset, Nicolas Barnier

Publication date: 20 August 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000032574.01332.98

zbMATH Keywords

greedy algorithm; graph coloring; cliques; constraint programming; air traffic flow management; route network

Mathematics Subject Classification ID

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

Graph Coloring Lower Bounds from Decision Diagrams, A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft, Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling, On the binary formulation of air traffic flow management problems, Analysing the benefits of trajectory deviations for planar trajectory optimisation, 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, Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem, Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem, On the structure of (even hole, kite)-free graphs, Graph coloring with decision diagrams, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, A matrix approach to hypergraph stable set and coloring problems with its application to storing problem, 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