| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1890564 | Chaos, Solitons & Fractals | 2009 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Physics and Astronomy
Statistical and Nonlinear Physics
Authors
M. Soleimani-damaneh,