Routing multi-class traffic flows in the plane

DOI10.1016/J.COMGEO.2011.09.003MaRDI QIDQ427052zbMATH OpenOpenAlexFDO

Authors Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Shang Yang, Jingyu Zou

Publication date 13 June 2012

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2011.09.003

zbMATH Keywords

approximation algorithmsair traffic managementmulti-commodity flowgeometric maximum flowoptimal paths

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Traffic problems in operations research (90B20)

Recommendations

• Maximum thick paths in static and dynamic environments
• Some properties of the fleet assignment problem
• The air traffic flow management problem with enroute capacities
• Routing a maximum number of disks through a scene of moving obstacles
• Multicommodity flows over time: Efficient algorithms and complexity

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• An optimal algorithm for finding the separation of simple polygons
• Maximal flow through a domain
• Maximum thick paths in static and dynamic environments
• Multicommodity flow, well-linked terminals, and routing problems
• On maximum flows in polyhedral domains
• Path Planning in 0/1/∞ Weighted Regions with Applications
• Thick non-crossing paths and minimum-cost flows in polygonal domains

Cited in

(4)

• Flight planning in free route airspaces
• Thick non-crossing paths in a polygonal domain
• Maximum thick paths in static and dynamic environments
• Routing a maximum number of disks through a scene of moving obstacles

This page was built for publication: Routing multi-class traffic flows in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427052)