Abstract

International audience; This paper addresses the classical graph partitioning problem applied to the air network. We consider an air transportation network with aircraft inducing a control workload. This network has to be partitioned into K balanced sectors for which the cutting flow is minimized.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1109/icec.1998.699504
https://hal-enac.archives-ouvertes.fr/hal-00937715/document,
https://hal-enac.archives-ouvertes.fr/hal-00937715/file/Delahaye_ICEC1998.pdf
https://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=699504&contentType=Conference+Publications,
https://hal-enac.archives-ouvertes.fr/hal-00937715/document,
https://academic.microsoft.com/#/detail/1960041851
Back to Top

Document information

Published on 01/01/1998

Volume 1998, 1998
DOI: 10.1109/icec.1998.699504
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?