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

DOI10.1016/j.ejor.2016.07.008zbMath1394.90603OpenAlexW2460688902MaRDI QIDQ1752252

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

Publication date: 24 May 2018

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

Full work available at URL: https://hal-insa-rennes.archives-ouvertes.fr/hal-01353974/file/2016_Lehouillier_ATC_EJOR_preprint.pdf

zbMATH Keywords

decomposition methodsconflict resolutionair traffic controlmixed integer linear optimizationminimum weight maximum clique

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations ⋮ Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution ⋮ A mixed integer linear programming model for multi-sector planning using speed and heading changes

Uses Software

• CPLEX
• POPMUSIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers
• A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: velocity changes through a time horizon
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
• Graph coloring for air traffic flow management
• A review on algorithms for maximum clique problems
• The Air Traffic Flow Management Problem with Enroute Capacities
• The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach
• An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations
• Reducibility among Combinatorial Problems
• A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft

This page was built for publication: Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem