IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v8y2000i2p265-285.html
   My bibliography  Save this article

The generalizedp-Centdian on network

Author

Listed:
  • Dionisio Brito
  • José Moreno Pérez

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:topjnl:v:8:y:2000:i:2:p:265-285
    DOI: 10.1007/BF02628558
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02628558
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02628558?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. Jonathan Halpern, 1978. "Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph," Management Science, INFORMS, vol. 24(5), pages 535-544, January.
    2. 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).
    3. Moreno, JoseA., 1985. "A correction to the definition of local center," European Journal of Operational Research, Elsevier, vol. 20(3), pages 382-386, June.
    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. Campos Rodrí­guez, Clara M. & Moreno Pérez, José A., 2008. "Multiple voting location problems," European Journal of Operational Research, Elsevier, vol. 191(2), pages 437-453, December.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Welch, S. B. & Salhi, S., 1997. "The obnoxious p facility network location problem with facility interaction," European Journal of Operational Research, Elsevier, vol. 102(2), pages 302-319, October.
    9. Ogryczak, Wlodzimierz, 2000. "Inequality measures and equitable approaches to location problems," European Journal of Operational Research, Elsevier, vol. 122(2), pages 374-391, April.
    10. Carrizosa, E. J. & Puerto, J., 1995. "A discretizing algorithm for location problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 166-174, January.
    11. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 187-226, July.
    12. Martínez-Merino, Luisa I. & Albareda-Sambola, Maria & Rodríguez-Chía, Antonio M., 2017. "The probabilistic p-center problem: Planning service for potential customers," European Journal of Operational Research, Elsevier, vol. 262(2), pages 509-520.
    13. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    14. Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.
    15. Yoshiaki Ohsawa, 2000. "Bicriteria Euclidean location associated with maximin and minimax criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(7), pages 581-592, October.
    16. Ohsawa, Yoshiaki, 1999. "A geometrical solution for quadratic bicriteria location models," European Journal of Operational Research, Elsevier, vol. 114(2), pages 380-388, April.
    17. Adel A. Aly & Boubekeur Rahali, 1990. "Analysis of a bicriteria location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 937-944, December.
    18. 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.
    19. 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.
    20. 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.

    More about this item

    Keywords

    Location; Centdian; Networks; 68Q20; 68R99; 05C85; 90C35;
    All these keywords.

    JEL classification:

    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:spr:topjnl:v:8:y:2000:i:2:p:265-285. 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.