IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v160y2005i2p395-415.html
   My bibliography  Save this article

Graceful reassignment of excessively long communications paths in networks

Author

Listed:
  • Luss, Hanan
  • Wong, Richard T.

Abstract

No abstract is available for this item.

Suggested Citation

  • Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    • Handle: RePEc:eee:ejores:v:160:y:2005:i:2:p:395-415
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00543-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Anantaram Balakrishnan & Kemal Altinkemer, 1992. "Using a Hop-Constrained Model to Generate Alternative Communication Network Design," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 192-205, May.
    2. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    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. Inayatullah Shah & Mohammed El Affendi & Basit Qureshi, 2020. "SRide: An Online System for Multi-Hop Ridesharing," Sustainability, MDPI, vol. 12(22), pages 1-29, November.
    2. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    3. Marco Pozzoni & Giulia Ceccarelli & Andrea Gorrini & Lorenza Manenti & Luigi Sanfilippo, 2023. "TomTom Data Applications for the Assessment of Tactical Urbanism Interventions: The Case of Bologna," Sustainability, MDPI, vol. 15(17), pages 1-32, August.
    4. Li, Yuanyuan & Liu, Yang & Xie, Jun, 2020. "A path-based equilibrium model for ridesharing matching," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 373-405.
    5. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    6. Suman, Hemant K. & Bolia, Nomesh B., 2019. "Improvement in direct bus services through route planning," Transport Policy, Elsevier, vol. 81(C), pages 263-274.
    7. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    8. Siripirote, Treerapot & Sumalee, Agachai & Ho, H.W. & Lam, William H.K., 2015. "Statistical approach for activity-based model calibration based on plate scanning and traffic counts data," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 280-300.
    9. Chung, Jaehoon & Yao, Enjian & Pan, Long & Ko, Joonho, 2024. "Understanding the route choice preferences of private and dock-based public bike users using GPS data in Seoul, South Korea," Journal of Transport Geography, Elsevier, vol. 116(C).
    10. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    11. Pierre-Léo Bourbonnais & Catherine Morency & Martin Trépanier & Éric Martel-Poliquin, 2021. "Transit network design using a genetic algorithm with integrated road network and disaggregated O–D demand data," Transportation, Springer, vol. 48(1), pages 95-130, February.
    12. Yuanhao Zhang & Jiabao Zhao, 2022. "A Novel Coordination Mechanism for Connected and Automated Vehicles in the Multi-Intersection Road Network," Energies, MDPI, vol. 15(14), pages 1-16, July.
    13. Zvyagina, Tatiana & Zvyagin, Petr, 2022. "A model of multi-objective route optimization for a vessel in drifting ice," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    14. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    15. Muhammed Nura Yusuf & Kamalrulnizam bin Abu Bakar & Babangida Isyaku & Ahmed Hamza Osman & Maged Nasser & Fatin A. Elhaj, 2023. "Adaptive Path Selection Algorithm with Flow Classification for Software-Defined Networks," Mathematics, MDPI, vol. 11(6), pages 1-24, March.
    16. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    17. Pengyu Chen & Mauricio Fiallos-Torres & Yuzhong Xing & Wei Yu & Chunqiu Guo & Joseph Leines-Artieda & Muwei Cheng & Hongbing Xie & Haidong Shi & Zhenyu Mao & Jijun Miao & Kamy Sepehrnoori, 2020. "Water Intrusion Characterization in Naturally Fractured Gas Reservoir Based on Spatial DFN Connectivity Analysis," Energies, MDPI, vol. 13(16), pages 1-37, August.
    18. Chang, Kuo-Hao & Hsiung, Tzu-Yi & Chang, Tzu-Yin, 2022. "Multi-Commodity distribution under uncertainty in disaster response phase: Model, solution method, and an empirical study," European Journal of Operational Research, Elsevier, vol. 303(2), pages 857-876.
    19. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    20. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).

    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:eee:ejores:v:160:y:2005:i:2:p:395-415. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.