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

A polynomial algorithm for the multicriteria cent-dian location problem

Author

Listed:
  • Colebrook, Marcos
  • Sicilia, Joaquin

Abstract

No abstract is available for this item.

Suggested Citation

  • Colebrook, Marcos & Sicilia, Joaquin, 2007. "A polynomial algorithm for the multicriteria cent-dian location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1008-1024, June.
    • Handle: RePEc:eee:ejores:v:179:y:2007:i:3:p:1008-1024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00089-0
    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. Badri, Masood A. & Mortagy, Amr K. & Alsayed, Colonel Ali, 1998. "A multi-objective model for locating fire stations," European Journal of Operational Research, Elsevier, vol. 110(2), pages 243-260, October.
    2. Mladineo, N. & Margeta, J. & Brans, J.P. & Mareschal, B., 1987. "Multicriteria ranking of alternative locations for small scale hydro plants," European Journal of Operational Research, Elsevier, vol. 31(2), pages 215-222, August.
    3. R.M. Ramos & M.T. Ramos & M. Colebrook & J. Sicilia, 1999. "Locating a facility on a network with multiple median‐type objectives," Annals of Operations Research, Springer, vol. 86(0), pages 221-235, January.
    4. Jonathan Halpern, 1980. "Duality in the Cent-Dian of a Graph," Operations Research, INFORMS, vol. 28(3-part-ii), pages 722-735, June.
    5. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    6. Gabriel Y. Handler, 1985. "Medi-Centers of a Tree," Transportation Science, INFORMS, vol. 19(3), pages 246-260, August.
    7. Jonathan Halpern, 1978. "Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph," Management Science, INFORMS, vol. 24(5), pages 535-544, January.
    8. HANSEN, Pierre & LABBE, Martine & THISSE, Jacques-François, 1991. "From the median to the generalized center," LIDAM Reprints CORE 937, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Min, Hokey, 1987. "A multiobjective retail service location model for fastfood restaurants," Omega, Elsevier, vol. 15(5), pages 429-441.
    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. Li, Hongmei & Luo, Taibo & Xu, Yinfeng & Xu, Jiuping, 2018. "Minimax regret vertex centdian location problem in general dynamic networks," Omega, Elsevier, vol. 75(C), pages 87-96.
    2. Alonso, Sergio & Domínguez-Ríos, Miguel Ángel & Colebrook, Marcos & Sedeo-Noda, Antonio, 2009. "Optimality conditions in preference-based spanning tree problems," European Journal of Operational Research, Elsevier, vol. 198(1), pages 232-240, October.
    3. Kalcsics, Jörg & Nickel, Stefan & Pozo, Miguel A. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2014. "The multicriteria p-facility median location problem on networks," European Journal of Operational Research, Elsevier, vol. 235(3), pages 484-493.
    4. Brazil, M. & Ras, C.J. & Thomas, D.A., 2014. "A geometric characterisation of the quadratic min-power centre," European Journal of Operational Research, Elsevier, vol. 233(1), pages 34-42.

    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. Li, Hongmei & Luo, Taibo & Xu, Yinfeng & Xu, Jiuping, 2018. "Minimax regret vertex centdian location problem in general dynamic networks," Omega, Elsevier, vol. 75(C), pages 87-96.
    2. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, April.
    3. Ohsawa, Yoshiaki, 1999. "A geometrical solution for quadratic bicriteria location models," European Journal of Operational Research, Elsevier, vol. 114(2), pages 380-388, April.
    4. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    5. Liying Kang & Jianjie Zhou & Erfang Shan, 2018. "Algorithms for connected p-centdian problem on block graphs," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 252-263, July.
    6. Dieperink, H. & Nijkamp, P., 1987. "A multiple criteria location model for innovative firms in a communication network," Serie Research Memoranda 0072, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    7. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "A bi-objective approach to discrete cost-bottleneck location problems," Annals of Operations Research, Springer, vol. 267(1), pages 179-201, August.
    8. 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.
    9. Berman, Oded & Hajizadeh, Iman & Krass, Dmitry & Rahimi-Vahed, Alireza, 2018. "Reconfiguring a set of coverage-providing facilities under travel time uncertainty," Socio-Economic Planning Sciences, Elsevier, vol. 62(C), pages 1-12.
    10. Becker, Ronald I. & Lari, Isabella & Scozzari, Andrea, 2007. "Algorithms for central-median paths with bounded length on trees," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1208-1220, June.
    11. Alfredo Marín & Stefan Nickel & Sebastian Velten, 2010. "An extended covering model for flexible discrete and equity location problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 125-163, February.
    12. Soudabeh Seyyedi Ghomi & Fahimeh Baroughi, 2024. "Robust vertex centdian facility location problem on tree networks," Annals of Operations Research, Springer, vol. 341(2), pages 1135-1149, October.
    13. Zhi-Chun Li & Qian Liu, 2020. "Optimal deployment of emergency rescue stations in an urban transportation corridor," Transportation, Springer, vol. 47(1), pages 445-473, February.
    14. Dionisio Brito & José Moreno Pérez, 2000. "The generalizedp-Centdian on network," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 265-285, December.
    15. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    16. Farahani, Reza Zanjirani & Fallah, Samira & Ruiz, Rubén & Hosseini, Sara & Asgari, Nasrin, 2019. "OR models in urban service facility location: A critical review of applications and future developments," European Journal of Operational Research, Elsevier, vol. 276(1), pages 1-27.
    17. Amin Akbari & Ronald Pelot & H. A. Eiselt, 2018. "A modular capacitated multi-objective model for locating maritime search and rescue vessels," Annals of Operations Research, Springer, vol. 267(1), pages 3-28, August.
    18. Alfandari, Laurent, 2004. "Choice Rules with Size Constraints for Multiple Criteria Decision Making," ESSEC Working Papers DR 04002, ESSEC Research Center, ESSEC Business School.
    19. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    20. M Horn, 1996. "Analysis and Computational Schemes for p-Median Heuristics," Environment and Planning A, , vol. 28(9), pages 1699-1708, September.

    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:179:y:2007:i:3:p:1008-1024. 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.