https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Cafieri_2012aCafieri 2012a - Revision history2026-04-18T12:47:19ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Cafieri_2012a&diff=202129&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 354337630 to Cafieri 2012a2021-02-02T05:07:44Z<p>Scipediacontent moved page <a href="/public/Draft_Content_354337630" class="mw-redirect" title="Draft Content 354337630">Draft Content 354337630</a> to <a href="/public/Cafieri_2012a" title="Cafieri 2012a">Cafieri 2012a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 05:07, 2 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Cafieri_2012a&diff=202128&oldid=prevScipediacontent: Created page with " == Abstract == Detecting and solving aircraft conflicts, which occur when aircraft sharing the same airspace are too close to each other according to their predicted traject..."2021-02-02T05:07:33Z<p>Created page with " == Abstract == Detecting and solving aircraft conflicts, which occur when aircraft sharing the same airspace are too close to each other according to their predicted traject..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
Detecting and solving aircraft conflicts, which occur when aircraft sharing the same airspace are too close to each other according to their predicted trajectories, is a crucial problem in Air Traffic Management. We focus on mixed-integer optimization models based on speed regulation. We first solve the problem to global optimality by means of an exact solver. The problem being very difficult to solve, we also propose a heuristic procedure where the problem is decomposed and it is locally solved by an exact solver. Computational results show that the proposed approach provides satisfactory results in reasonable time.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://hal-enac.archives-ouvertes.fr/hal-00938762 https://hal-enac.archives-ouvertes.fr/hal-00938762],<br />
: [https://hal-enac.archives-ouvertes.fr/hal-00938762/document https://hal-enac.archives-ouvertes.fr/hal-00938762/document],<br />
: [https://hal-enac.archives-ouvertes.fr/hal-00938762/file/Cafieri_GOW2012.pdf https://hal-enac.archives-ouvertes.fr/hal-00938762/file/Cafieri_GOW2012.pdf]</div>Scipediacontent