A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft

DOI10.1007/978-3-319-18161-5_1zbMath1370.90076OpenAlexW822614190MaRDI QIDQ5356963

François Soumis, Jérémy Omer, Thibault Lehouillier, Guy Desaulniers

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_1

zbMATH Keywords

mixed integer linear programmingconflict resolutionmaximum cliqueair traffic control

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem

Cites Work

• Unnamed Item
• A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers
• A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
• Graph coloring for air traffic flow management

This page was built for publication: A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft