Maximal flow in possibilistic networks

M. Soleimani-damaneh

Chaos, Solitons & Fractals, 2009, vol. 40, issue 1, 370-375

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.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077907005851
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:40:y:2009:i:1:p:370-375

DOI: 10.1016/j.chaos.2007.07.071

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().