IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v347y2025i3d10.1007_s10479-024-06361-2.html
   My bibliography  Save this article

The absolute quickest 1-center problem on a cycle and its reverse problem

Author

Listed:
  • Kien Trung Nguyen

    (Can Tho University)

Abstract

The concept of the quickest path refers to the path with the minimum transmission time, considering both its length and capacity. We investigate the problem of finding a point on a cycle such that the maximum quickest distance from any vertex to that point is minimized. We refer to this problem as the quickest 1-center problem on cycles. First, we solve the problem on paths in linear time based on the optimality criterion. Then, we address the problem on cycles in $$O(n^2)$$ O ( n 2 ) time by leveraging the solution approach on the induced path in each iteration, where n is the number of vertices. We also consider the problem of reducing the quickest distance objective at a predetermined vertex of a cycle as much as possible by augmenting the edge capacities within a given budget. This problem is called the reverse quickest 1-center problem on cycles. We develop a combinatorial algorithm that solves the problem in $$O(n^2)$$ O ( n 2 ) time by solving each subproblem in linear time.

Suggested Citation

  • Kien Trung Nguyen, 2025. "The absolute quickest 1-center problem on a cycle and its reverse problem," Annals of Operations Research, Springer, vol. 347(3), pages 1473-1491, April.
    • Handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-024-06361-2
    DOI: 10.1007/s10479-024-06361-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06361-2
    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/s10479-024-06361-2?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.

    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:annopr:v:347:y:2025:i:3:d:10.1007_s10479-024-06361-2. 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.