IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v63y2016i4d10.1007_s11235-016-0151-9.html
   My bibliography  Save this article

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

Author

Listed:
  • Mehdi Ghiyasvand

    (Bu-Ali Sina University)

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.

Suggested Citation

  • Mehdi Ghiyasvand, 2016. "An $$O(mn \log U)$$ O ( m n log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(4), pages 719-725, December.
    • Handle: RePEc:spr:telsys:v:63:y:2016:i:4:d:10.1007_s11235-016-0151-9
    DOI: 10.1007/s11235-016-0151-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0151-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0151-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:63:y:2016:i:4:d:10.1007_s11235-016-0151-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.