We present a minimum-weight maximum-cardinality clique model for the air conflict resolution problem.
The modeling of aircraft, maneuvers and costs are fully separated from the resolution process.
We develop one decomposition method to find a trade-off between solution time and cost.
We develop one decomposition method to exploit the geometry of the instances.
We illustrate the significance of these decompositions on large random instances.