Maximal flow in possibilistic networks

In this study the determination of maximal flow in possibilistic networks with multiple sinks is studied. To do so, a time-continuous optimization problem is provided and an effective approach to solve it is introduced.