A comparative study of different approaches for finding the upper boundary points in stochastic-flow networks
Year of publication: |
2014
|
---|---|
Authors: | Mansourzadeh, Seyed Mehdi ; Nasseri, Seyed Hadi ; Forghani-Elahabad, Majid ; Ebrahimnejad, Ali |
Published in: |
International journal of enterprise information systems : an official publication of the Information Resources Management Association. - Hershey, Pa. [u.a.] : IGI Publ., ISSN 1548-1115, ZDB-ID 2414367-4. - Vol. 10.2014, 3, p. 13-23
|
Subject: | Algorithm | Information System Network (ISN) | Minimal Cuts (MCs) | Reliability | Stochastic-Flow Network (SFN) | Algorithmus | Unternehmensnetzwerk | Business network | Netzwerk | Network | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Soziales Netzwerk | Social network | Informationssystem | Information system |
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
-
Scheduling using interactive optimization oracles for constrained queueing networks
Suk, Tonghoon, (2017)
-
A linear input dependence model for interdependent networks
Kaul, Hemanshu, (2022)
- More ...
-
Tavana, Madjid, (2018)
-
Revised simplex method and its application for solving fuzzy linear programming problems
Nasseri, Seyed Hadi, (2012)
-
Revised simplex method and its application for solving fuzzy linear programming problems
Nasseri, Seyed Hadi, (2012)
- More ...