(Created page with " == Abstract == International audience; This paper addresses the classical graph partitioning problem applied to the air network. We consider an air transportation network wi...") |
m (Scipediacontent moved page Draft Content 808088255 to Alliot et al 1998a) |
(No difference)
| |
Latest revision as of 07:05, 2 February 2021
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:
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
Share this document
Keywords
claim authorship
Are you one of the authors of this document?