IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i1d10.1007_s10878-016-0070-4.html
   My bibliography  Save this article

A faster strongly polynomial time algorithm to solve the minimum cost tension problem

Author

Listed:
  • Mehdi Ghiyasvand

    (Bu-Ali Sina University)

Abstract

This paper presents a strongly polynomial time algorithm for the minimum cost tension problem, which runs in $$O(\max \{m^3n, m^2 \log n(m+n \log n)\})$$ O ( max { m 3 n , m 2 log n ( m + n log n ) } ) time, where n and m denote the number of nodes and number of arcs, respectively. Our algorithm improves upon the previous strongly polynomial time of $$O(n^4 m^3 \log n)$$ O ( n 4 m 3 log n ) due to Hadjiat and Maurras (Discret Math 165(166):377–394, 1997).

Suggested Citation

  • Mehdi Ghiyasvand, 2017. "A faster strongly polynomial time algorithm to solve the minimum cost tension problem," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 203-217, July.
    • Handle: RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0070-4
    DOI: 10.1007/s10878-016-0070-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-0070-4
    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/s10878-016-0070-4?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.

    References listed on IDEAS

    as
    1. Andrew V. Goldberg & Robert E. Tarjan, 1990. "Finding Minimum-Cost Circulations by Successive Approximation," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 430-466, August.
    2. Ravindra K. Ahuja & Dorit S. Hochbaum & James B. Orlin, 2003. "Solving the Convex Cost Integer Dual Network Flow Problem," Management Science, INFORMS, vol. 49(7), pages 950-964, July.
    3. Bachelet, Bruno & Duhamel, Christophe, 2009. "Aggregation approach for the minimum binary cost tension problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 837-841, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mehdi Ghiyasvand, 2019. "An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 957-969, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mehdi Ghiyasvand, 2019. "An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 957-969, April.
    2. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    3. Nathan Atkinson & Scott C. Ganz & Dorit S. Hochbaum & James B. Orlin, 2023. "The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings," Papers 2307.15702, arXiv.org, revised Jan 2024.
    4. Durga Prasad Khanal & Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2022. "Efficient Algorithms for Abstract Flow with Partial Switching," SN Operations Research Forum, Springer, vol. 3(4), pages 1-17, December.
    5. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    6. Zhao Zhang & Zaixin Lu & Xianyue Li & Xiaohui Huang & Ding-Zhu Du, 2019. "Online hole healing for sensor coverage," Journal of Global Optimization, Springer, vol. 75(4), pages 1111-1131, December.
    7. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    8. Lin, Yi-Kuei, 2006. "Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts," Reliability Engineering and System Safety, Elsevier, vol. 91(5), pages 539-545.
    9. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2000. "A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem," Transportation Science, INFORMS, vol. 34(3), pages 289-302, August.
    10. David Wu & Viet Hung Nguyen & Michel Minoux & Hai Tran, 2022. "Optimal deterministic and robust selection of electricity contracts," Journal of Global Optimization, Springer, vol. 82(4), pages 993-1013, April.
    11. Bachelet, Bruno & Duhamel, Christophe, 2009. "Aggregation approach for the minimum binary cost tension problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 837-841, September.
    12. Dorit S. Hochbaum & Asaf Levin, 2006. "Methodologies and Algorithms for Group-Rankings Decision," Management Science, INFORMS, vol. 52(9), pages 1394-1408, September.
    13. Al-Takrouri, Saleh & Savkin, Andrey V., 2013. "A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(23), pages 6135-6145.
    14. Dorit Hochbaum, 2007. "Complexity and algorithms for nonlinear optimization problems," Annals of Operations Research, Springer, vol. 153(1), pages 257-296, September.
    15. Antonio Frangioni & Antonio Manca, 2006. "A Computational Study of Cost Reoptimization for Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 61-70, February.
    16. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    17. Castro, Jordi & Nasini, Stefano, 2021. "A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks," European Journal of Operational Research, Elsevier, vol. 290(3), pages 857-869.
    18. Wang, Yan & Wang, Junwei, 2019. "Integrated reconfiguration of both supply and demand for evacuation planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 82-94.
    19. Thomas W. M. Vossen & R. Kevin Wood & Alexandra M. Newman, 2016. "Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing," Operations Research, INFORMS, vol. 64(4), pages 771-793, August.
    20. Dorit S. Hochbaum, 2004. "50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today," Management Science, INFORMS, vol. 50(6), pages 709-723, June.

    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:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0070-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.