Published April 15, 2009 | Version v1
Journal article Metadata-only

Maximal flow in possibilistic networks

Creators

  • 1. Faculty of Mathematical Sciences and Computer Engineering, Teacher Training University, 599 Taleghani Avenue, Tehran 1561836314 (Iran, Islamic Republic of)

Description

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.

Availability note (English)

Available from http://dx.doi.org/10.1016/j.chaos.2007.07.071

Additional details

Identifiers

DOI
10.1016/j.chaos.2007.07.071;
PII
S0960-0779(07)00585-1;

Publishing Information

Journal Title
Chaos, Solitons and Fractals
Journal Volume
40
Journal Issue
1
Journal Page Range
p. 370-375
ISSN
0960-0779

INIS

Country of Publication
United Kingdom
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
41008831
Subject category
S97: MATHEMATICAL METHODS AND COMPUTING;
Descriptors DEI
MATHEMATICAL LOGIC; NETWORK ANALYSIS; OPTIMIZATION

Optional Information

Copyright
Copyright (c) 2007 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.