TY - CONF A1 - Schade, Stanley A1 - Strehler, Martin A2 - Goerigk, Marc A2 - Werneck, Renato T1 - The Maximum Flow Problem for Oriented Flows T2 - 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016) N2 - In several applications of network flows, additional constraints have to be considered. In this paper, we study flows, where the flow particles have an orientation. For example, cargo containers with doors only on one side and train coaches with 1st and 2nd class compartments have such an orientation. If the end position has a mandatory orientation, not every path from source to sink is feasible for routing or additional transposition maneuvers have to be made. As a result, a source-sink path may visit a certain vertex several times. We describe structural properties of optimal solutions, determine the computational complexity, and present an approach for approximating such flows. KW - network flow with orientation, graph expansion, approximation, container logistics, train routing Y1 - 2017 UR - https://opus4.kobv.de/opus4-UBICO/frontdoor/index/index/docId/19629 UR - https://nbn-resolving.org/urn:nbn:de:0030-drops-65318 UR - http://drops.dagstuhl.de/opus/volltexte/2016/6531 SN - 978-3-95977-021-7 SP - 1 EP - 13 PB - Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik CY - Dagstuhl, Germany ER -