Routing multi-class traffic flows in the plane

DOI10.1016/j.comgeo.2011.09.003zbMath1239.90026OpenAlexW2052075839MaRDI QIDQ427052

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

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

air traffic managementapproximation algorithmsmulti-commodity flowgeometric maximum flowoptimal paths

Mathematics Subject Classification ID

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

Related Items (1)

Thick non-crossing paths in a polygonal domain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On maximum flows in polyhedral domains
• Multicommodity flow, well-linked terminals, and routing problems
• Thick non-crossing paths and minimum-cost flows in polygonal domains
• Maximal flow through a domain
• Path Planning in 0/1/∞ Weighted Regions with Applications
• An optimal algorithm for finding the separation of simple polygons
• Maximum thick paths in static and dynamic environments

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