IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v56y2019i3d10.1007_s12597-019-00385-0.html
   My bibliography  Save this article

Small-m method for detecting all longest paths

Author

Listed:
  • Hiroyuki Goto

    (University of California at Santa Barbara)

  • Alan T. Murray

    (University of California at Santa Barbara)

Abstract

Given a weighted directed graph without positive cycles, we construct a framework to detect all longest paths for pairs of nodes in a network. The interest is to identify all routes with the highest cumulative cost for each source–destination pair. The significance and need for this arises in several scheduling contexts, an example of which is called critical chain project management. All longest routes are enumerated and compared for each output to determine a bottleneck path referred to as critical chain. Besides finding longest paths, minimizing duration needs to be considered. This indicates that multiple types of optimization problems coexist in one methodology. We thus aim to contain the longest-paths problem through constraints, for which an optimal solution that minimizes duration can be detected by solving a single optimization problem. The framework is reduced to a constraint satisfaction problem in a mixed-integer linear-programming context, and the solution can be derived using a general purpose solver. Optimality for the longest-paths problem is proven using the small-m method. Since the developed framework does not require an objective function specification, the methodology can also be incorporated within other optimization based problem contexts.

Suggested Citation

  • Hiroyuki Goto & Alan T. Murray, 2019. "Small-m method for detecting all longest paths," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 824-839, September.
  • Handle: RePEc:spr:opsear:v:56:y:2019:i:3:d:10.1007_s12597-019-00385-0
    DOI: 10.1007/s12597-019-00385-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00385-0
    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/s12597-019-00385-0?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. Taccari, Leonardo, 2016. "Integer programming formulations for the elementary shortest path problem," European Journal of Operational Research, Elsevier, vol. 252(1), pages 122-130.
    Full references (including those not matched with items on IDEAS)

    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. Lee, Jisun & Joung, Seulgi & Lee, Kyungsik, 2022. "A fully polynomial time approximation scheme for the probability maximizing shortest path problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 35-45.
    2. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "An effective two phase heuristic for synchronized seru production scheduling and 3PL transportation problems," International Journal of Production Economics, Elsevier, vol. 268(C).
    3. Tereza Sedlářová Nehézová & Michal Škoda & Robert Hlavatý & Helena Brožová, 2022. "Fuzzy and robust approach for decision-making in disaster situations," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(2), pages 617-645, June.
    4. Lera-Romero, Gonzalo & Miranda-Bront, Juan José, 2021. "A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 879-896.
    5. Sergey S. Ketkov, 2023. "On the Multistage Shortest Path Problem Under Distributional Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 277-308, April.
    6. Longsheng Sun & Mark H. Karwan & Changhyun Kwon, 2018. "Generalized Bounded Rationality and Robust Multicommodity Network Design," Operations Research, INFORMS, vol. 66(1), pages 42-57, 1-2.
    7. Rafael Castro Andrade & Rommel Dias Saraiva, 2020. "MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles," Annals of Operations Research, Springer, vol. 286(1), pages 147-172, March.

    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:opsear:v:56:y:2019:i:3:d:10.1007_s12597-019-00385-0. 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.