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

Algorithms for the robust 1-center problem on a tree

Author

Listed:
  • Averbakh, Igor
  • Berman, Oded

Abstract

No abstract is available for this item.

Suggested Citation

  • Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
  • Handle: RePEc:eee:ejores:v:123:y:2000:i:2:p:292-302
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00257-X
    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. H. Frank, 1966. "Optimum Locations on a Graph with Probabilistic Demands," Operations Research, INFORMS, vol. 14(3), pages 409-421, June.
    2. Martine Labbé & Jacques-François Thisse & Richard E. Wendell, 1991. "Sensitivity Analysis in Minisum Facility Location Problems," Operations Research, INFORMS, vol. 39(6), pages 961-969, December.
    3. George O. Wesolowsky, 1977. "Probabilistic Weights in the One-Dimensional Facility Location Problem," Management Science, INFORMS, vol. 24(2), pages 224-229, October.
    4. 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. Conde, Eduardo, 2007. "Minmax regret location-allocation problem on a network under uncertainty," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1025-1039, June.
    2. Bell, Michael G.H. & Fonzone, Achille & Polyzoni, Chrisanthi, 2014. "Depot location in degradable transport networks," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 148-161.
    3. Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
    4. S Mudchanatongsuk & F Ordóñez & J Liu, 2008. "Robust solutions for network design under transportation cost and demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 652-662, May.
    5. Berman, Oded & Wang, Jiamin, 2011. "The minmax regret gradual covering location problem on a network with incomplete information of demand weights," European Journal of Operational Research, Elsevier, vol. 208(3), pages 233-238, February.
    6. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    7. Marc Demange & Virginie Gabrel & Marcel A. Haddad & Cécile Murat, 2020. "A robust p-Center problem under pressure to locate shelters in wildfire context," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 103-139, June.
    8. Nikulin, Yury, 2006. "Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 606, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Lu, Chung-Cheng, 2013. "Robust weighted vertex p-center model considering uncertain data: An application to emergency management," European Journal of Operational Research, Elsevier, vol. 230(1), pages 113-121.
    10. Jurij Mihelič & Borut Robič, 2010. "Flexible-attribute problems," Computational Optimization and Applications, Springer, vol. 47(3), pages 553-566, November.
    11. Mihelic, Jurij & Mahjoub, Amine & Rapine, Christophe & Robic, Borut, 2010. "Two-stage flexible-choice problems under uncertainty," European Journal of Operational Research, Elsevier, vol. 201(2), pages 399-403, March.
    12. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2023. "Robust maximum capture facility location under random utility maximization models," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1128-1150.
    13. Wang, Haitao, 2014. "Minmax regret 1-facility location on uncertain path networks," European Journal of Operational Research, Elsevier, vol. 239(3), pages 636-643.
    14. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.

    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. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    2. Igor Averbakh, 2005. "The Minmax Relative Regret Median Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 451-461, November.
    3. George L. Vairaktarakis & Panagiotis Kouvelis, 1999. "Incorporation dynamic aspects and uncertainty in 1‐median location problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 147-168, March.
    4. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    5. K Sörensen, 2008. "Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 624-636, May.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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).
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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).
    17. 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.
    18. O Berman & Z Drezner, 2003. "A probabilistic one-centre location problem on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 871-877, August.
    19. 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.
    20. 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).

    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:123:y:2000:i:2:p:292-302. 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.