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

The computational complexity of the relative robust shortest path problem with interval data

Author

Listed:
  • Zielinski, Pawel

Abstract

No abstract is available for this item.

Suggested Citation

  • Zielinski, Pawel, 2004. "The computational complexity of the relative robust shortest path problem with interval data," European Journal of Operational Research, Elsevier, vol. 158(3), pages 570-576, November.
    • Handle: RePEc:eee:ejores:v:158:y:2004:i:3:p:570-576
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00373-4
    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. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    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. Carolin Torchiani & Jan Ohst & David Willems & Stefan Ruzika, 2017. "Shortest Paths with Shortest Detours," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 858-874, September.
    2. Nikulin, Yury, 2005. "Solving the robust shortest path problem with interval data using a probabilistic metaheuristic approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 597, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Marc Goerigk & Marie Schmidt & Anita Schöbel & Martin Knoth & Matthias Müller-Hannemann, 2014. "The Price of Strict and Light Robustness in Timetable Information," Transportation Science, INFORMS, vol. 48(2), pages 225-242, May.
    4. Nikulin, Y. & Karelkina, O. & Mäkelä, M.M., 2013. "On accuracy, robustness and tolerances in vector Boolean optimization," European Journal of Operational Research, Elsevier, vol. 224(3), pages 449-457.
    5. Yinfeng Xu & Huili Zhang, 2015. "How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1062-1076, November.
    6. Chunlin Xin & Letu Qingge & Jiamin Wang & Binhai Zhu, 2015. "Robust optimization for the hazardous materials transportation network design problem," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 320-334, August.
    7. Conde, Eduardo & Candia, Alfredo, 2007. "Minimax regret spanning arborescences under uncertain costs," European Journal of Operational Research, Elsevier, vol. 182(2), pages 561-577, October.
    8. Conde, Eduardo, 2009. "A minmax regret approach to the critical path method with task interval times," European Journal of Operational Research, Elsevier, vol. 197(1), pages 235-242, August.
    9. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.

    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. Jihee Han & KwangSup Shin, 2016. "Evaluation mechanism for structural robustness of supply chain considering disruption propagation," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 135-151, January.
    2. Tsai, Jung-Fa, 2007. "An optimization approach for supply chain management models with quantity discount policy," European Journal of Operational Research, Elsevier, vol. 177(2), pages 982-994, March.
    3. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," 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. 28(1), pages 143-166, March.
    4. Sebastian Rachuba & Brigitte Werners, 2017. "A fuzzy multi-criteria approach for robust operating room schedules," Annals of Operations Research, Springer, vol. 251(1), pages 325-350, April.
    5. McKenna, Claire & Chalabi, Zaid & Epstein, David & Claxton, Karl, 2010. "Budgetary policies and available actions: A generalisation of decision rules for allocation and research decisions," Journal of Health Economics, Elsevier, vol. 29(1), pages 170-181, January.
    6. Golpîra, Hêriş, 2020. "Smart Energy-Aware Manufacturing Plant Scheduling under Uncertainty: A Risk-Based Multi-Objective Robust Optimization Approach," Energy, Elsevier, vol. 209(C).
    7. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    8. Tsao, Yu-Chung & Thanh, Vo-Van & Lu, Jye-Chyi, 2019. "Multiobjective robust fuzzy stochastic approach for sustainable smart grid design," Energy, Elsevier, vol. 176(C), pages 929-939.
    9. Chen, Andrew N.K. & Goes, Paulo B. & Gupta, Alok & Marsden, James R., 2006. "Heuristics for selecting robust database structures with dynamic query patterns," European Journal of Operational Research, Elsevier, vol. 168(1), pages 200-220, January.
    10. Golpîra, Hêriş & Khan, Syed Abdul Rehman, 2019. "A multi-objective risk-based robust optimization approach to energy management in smart residential buildings under combined demand and supply uncertainty," Energy, Elsevier, vol. 170(C), pages 1113-1129.
    11. Gilani, H. & Sahebi, H. & Oliveira, Fabricio, 2020. "Sustainable sugarcane-to-bioethanol supply chain network design: A robust possibilistic programming model," Applied Energy, Elsevier, vol. 278(C).
    12. Erfan Hassannayebi & Seyed Hessameddin Zegordi & Mohammad Reza Amin-Naseri & Masoud Yaghini, 2017. "Train timetabling at rapid rail transit lines: a robust multi-objective stochastic programming approach," Operational Research, Springer, vol. 17(2), pages 435-477, July.
    13. De Rosa, Vincenzo & Gebhard, Marina & Hartmann, Evi & Wollenweber, Jens, 2013. "Robust sustainable bi-directional logistics network design under uncertainty," International Journal of Production Economics, Elsevier, vol. 145(1), pages 184-198.
    14. Bastian, Nathaniel D. & Lunday, Brian J. & Fisher, Christopher B. & Hall, Andrew O., 2020. "Models and methods for workforce planning under uncertainty: Optimizing U.S. Army cyber branch readiness and manning," Omega, Elsevier, vol. 92(C).
    15. Hosseini-Motlagh, Seyyed-Mahdi & Samani, Mohammad Reza Ghatreh & Homaei, Shamim, 2020. "Toward a coordination of inventory and distribution schedules for blood in disasters," Socio-Economic Planning Sciences, Elsevier, vol. 72(C).
    16. Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
    17. Munoz, Francisco D. & van der Weijde, Adriaan Hendrik & Hobbs, Benjamin F. & Watson, Jean-Paul, 2017. "Does risk aversion affect transmission and generation planning? A Western North America case study," Energy Economics, Elsevier, vol. 64(C), pages 213-225.
    18. Xu, Y. & Huang, G.H. & Qin, X.S. & Cao, M.F., 2009. "SRCCP: A stochastic robust chance-constrained programming model for municipal solid waste management under uncertainty," Resources, Conservation & Recycling, Elsevier, vol. 53(6), pages 352-363.
    19. Azaron, A. & Brown, K.N. & Tarim, S.A. & Modarres, M., 2008. "A multi-objective stochastic programming approach for supply chain design considering risk," International Journal of Production Economics, Elsevier, vol. 116(1), pages 129-138, November.
    20. Xidonas, Panos & Hassapis, Christis & Soulis, John & Samitas, Aristeidis, 2017. "Robust minimum variance portfolio optimization modelling under scenario uncertainty," Economic Modelling, Elsevier, vol. 64(C), pages 60-71.

    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:158:y:2004:i:3:p:570-576. 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.