An $$O(mn \log U)$$ O ( m n log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network

Mehdi Ghiyasvand ()
Additional contact information
Mehdi Ghiyasvand: Bu-Ali Sina University

Telecommunication Systems: Modelling, Analysis, Design and Management, 2016, vol. 63, issue 4, No 15, 719-725

Abstract: Abstract This paper presents an $$O(mn \log U)$$ O ( m n log U ) time algorithm to solve the feasibility problem, where n, m and U are the number of nodes, arcs, and the value of maximum upper bound, respectively. The merit of this paper in comparison with maximum flow algorithms, is that it presents some information that is useful to modeler in estimating the maximum cost of adjusting the infeasible network. Our algorithm improves upon the previous $$O(mn \log (nU))$$ O ( m n log ( n U ) ) -time method due to Ghiyasvand (Appl Math Modell 35:5276–5285, 2011). Also, the algorithm computes a feasible flow if the given network is feasible, but the method of Ghiyasvand (Appl Math Modell 35:5276–5285, 2011) does not compute a feasible flow if it is feasible.

Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-016-0151-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:telsys:v:63:y:2016:i:4:d:10.1007_s11235-016-0151-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-016-0151-9

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().