The Maximum Flow Problem for Oriented Flows

Stanley Schade, Martin Strehler, Marc Herbstritt
2016 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
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 sourcesink path
more » ... 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.
doi:10.4230/oasics.atmos.2016.7 dblp:conf/atmos/SchadeS16 fatcat:nu4hduc3nbg57eskbvvkyicq2i