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

A new assignment rule to improve seed points algorithms for the continuous k-center problem

Author

Listed:
  • Pelegrin, B.
  • Canovas, L.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pelegrin, B. & Canovas, L., 1998. "A new assignment rule to improve seed points algorithms for the continuous k-center problem," European Journal of Operational Research, Elsevier, vol. 104(2), pages 366-374, January.
    • Handle: RePEc:eee:ejores:v:104:y:1998:i:2:p:366-374
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00191-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. D. Jack Elzinga & Donald W. Hearn, 1972. "The Minimum Covering Sphere Problem," Management Science, INFORMS, vol. 19(1), pages 96-104, September.
    2. Pelegrin, Blas & Michelot, Christian & Plastria, Frank, 1985. "On the uniqueness of optimal solutions in continuous location theory," European Journal of Operational Research, Elsevier, vol. 20(3), pages 327-331, June.
    3. R. Chen & G. Y. Handler, 1987. "Relaxation method for the solution of the minimax location‐allocation problem in euclidean space," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 775-788, December.
    4. Aneja, Y. P. & Chandrasekaran, R. & Nair, K. P. K., 1988. "A note on the m-center problem with rectilinear distances," European Journal of Operational Research, Elsevier, vol. 35(1), pages 118-123, April.
    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. Miren Bilbao & Sergio Gil-López & Javier Ser & Sancho Salcedo-Sanz & Mikel Sánchez-Ponte & Antonio Arana-Castro, 2014. "Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(3), pages 997-1016, October.
    2. Frank Plastria & Tom Blockmans, 2015. "Multidimensional Theoretic Consensus Reachability: The Impact of Distance Selection and Issue Saliences," Group Decision and Negotiation, Springer, vol. 24(1), pages 1-44, January.
    3. 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.
    4. Plastria, Frank, 2016. "How bad can the centroid be?," European Journal of Operational Research, Elsevier, vol. 252(1), pages 98-102.
    5. Callaghan, Becky & Salhi, Said & Nagy, Gábor, 2017. "Speeding up the optimal method of Drezner for the p-centre problem in the plane," European Journal of Operational Research, Elsevier, vol. 257(3), pages 722-734.
    6. R. Chen & Y. Handler, 1993. "The conditional p‐center problem in the plane," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 117-127, February.
    7. Hamacher, H. W. & Nickel, S., 1996. "Multicriteria planar location problems," European Journal of Operational Research, Elsevier, vol. 94(1), pages 66-86, October.
    8. 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.
    9. Metev, Boyan, 1995. "Use of reference points for solving MONLP problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 193-203, January.
    10. Díaz-Báñez, J.M. & Heredia, M. & Pelegrín, B. & Pérez-Lantero, P. & Ventura, I., 2011. "Finding all pure strategy Nash equilibria in a planar location game," European Journal of Operational Research, Elsevier, vol. 214(1), pages 91-98, October.
    11. Frank Plastria, 2021. "Using the power of ideal solutions: simple proofs of some old and new results in location theory," 4OR, Springer, vol. 19(3), pages 449-467, September.
    12. M. Cera & J. A. Mesa & F. A. Ortega & F. Plastria, 2008. "Locating a Central Hunter on the Plane," Journal of Optimization Theory and Applications, Springer, vol. 136(2), pages 155-166, February.
    13. Man Yu & Yafang Lv & Yanping Zhao & Chan He & Senlin Wu, 2023. "Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    14. H Younies & G O Wesolowsky, 2007. "Planar maximal covering location problem under block norm distance measure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 740-750, June.
    15. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    16. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    17. Minnie H. Patel & Deborah L. Nettles & Stuart J. Deutsch, 1993. "A linear‐programming‐based method for determining whether or not n demand points are on a hemisphere," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 543-552, June.
    18. P. M. Dearing & Mark E. Cawood, 2023. "The minimum covering Euclidean ball of a set of Euclidean balls in $$I\!\!R^n$$ I R n," Annals of Operations Research, Springer, vol. 322(2), pages 631-659, March.
    19. Chen, Doron & Chen, Reuven, 2013. "Optimal algorithms for the α-neighbor p-center problem," European Journal of Operational Research, Elsevier, vol. 225(1), pages 36-43.
    20. B. Pelegrín & L. Cánovas, 1996. "An improvement and an extension of the Elzinga & Hearn's algorithm to the 1-center problem in ℝ n withl 2b -normswithl 2b -norms," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(2), pages 269-284, December.

    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:104:y:1998:i:2:p:366-374. 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.