IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v76y2020i1d10.1007_s10898-019-00834-6.html
   My bibliography  Save this article

Solving k-center problems involving sets based on optimization techniques

Author

Listed:
  • Nguyen Thai An

    (University of Electronic Science and Technology of China
    Duy Tan University)

  • Nguyen Mau Nam

    (Portland State University)

  • Xiaolong Qin

    (Hangzhou Normal University
    University of Electronic Science and Technology of China
    Zhejiang Normal University)

Abstract

The continuous k-center problem aims at finding k balls with the smallest radius to cover a finite number of given points in $$\mathbb {R}^n$$Rn. In this paper, we propose and study the following generalized version of the k-center problem: Given a finite number of nonempty closed convex sets in $$\mathbb {R}^n$$Rn, find k balls with the smallest radius such that their union intersects all of the sets. Because of its nonsmoothness and nonconvexity, this problem is very challenging. Based on nonsmooth optimization techniques, we first derive some qualitative properties of the problem and then propose new algorithms to solve the problem. Numerical experiments are also provided to show the effectiveness of the proposed algorithms.

Suggested Citation

  • Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    • Handle: RePEc:spr:jglopt:v:76:y:2020:i:1:d:10.1007_s10898-019-00834-6
    DOI: 10.1007/s10898-019-00834-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00834-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00834-6?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. Hunter D.R. & Lange K., 2004. "A Tutorial on MM Algorithms," The American Statistician, American Statistical Association, vol. 58, pages 30-37, February.
    2. Zvi Drezner & George O. Wesolowsky, 1983. "Minimax and maximin facility location problems on a sphere," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(2), pages 305-312, June.
    3. 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.
    4. Thomas Jahn & Yaakov S. Kupitz & Horst Martini & Christian Richter, 2015. "Minsum Location Extended to Gauges and to Convex Sets," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 711-746, September.
    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. Nguyen Mau Nam & R. Blake Rector & Daniel Giles, 2017. "Minimizing Differences of Convex Functions with Applications to Facility Location and Clustering," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 255-278, April.
    7. Nguyen Thai An & Daniel Giles & Nguyen Mau Nam & R. Blake Rector, 2016. "The Log-Exponential Smoothing Technique and Nesterov’s Accelerated Gradient Method for Generalized Sylvester Problems," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 559-583, February.
    8. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    9. NESTEROV, Yu., 2005. "Smooth minimization of non-smooth functions," LIDAM Reprints CORE 1819, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Yinglin Luo & Meijuan Shang & Bing Tan, 2020. "A General Inertial Viscosity Type Method for Nonexpansive Mappings and Its Applications in Signal Processing," Mathematics, MDPI, vol. 8(2), pages 1-18, February.
    2. Mohammad Dehghani & Zeinab Montazeri & Štěpán Hubálovský, 2021. "GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems," Mathematics, MDPI, vol. 9(11), pages 1-23, May.
    3. Bing Tan & Shanshan Xu & Songxiao Li, 2020. "Modified Inertial Hybrid and Shrinking Projection Algorithms for Solving Fixed Point Problems," Mathematics, MDPI, vol. 8(2), pages 1-12, February.

    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. Nguyen Thai An & Daniel Giles & Nguyen Mau Nam & R. Blake Rector, 2016. "The Log-Exponential Smoothing Technique and Nesterov’s Accelerated Gradient Method for Generalized Sylvester Problems," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 559-583, February.
    2. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    3. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    4. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    5. Wen, Meilin & Iwamura, Kakuzo, 2008. "Fuzzy facility location-allocation problem under the Hurwicz criterion," European Journal of Operational Research, Elsevier, vol. 184(2), pages 627-635, January.
    6. Xin Feng & Alan T. Murray, 2018. "Allocation using a heterogeneous space Voronoi diagram," Journal of Geographical Systems, Springer, vol. 20(3), pages 207-226, July.
    7. Wei Ding & Ke Qiu, 2020. "Approximating the asymmetric p-center problem in parameterized complete digraphs," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 21-35, July.
    8. Averbakh, Igor & Berman, Oded, 1996. "Locating flow-capturing units on a network with multi-counting and diminishing returns to scale," European Journal of Operational Research, Elsevier, vol. 91(3), pages 495-506, June.
    9. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.
    10. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    11. Milosav Georgijevic & Sanja Bojic & Dejan Brcanov, 2013. "The location of public logistic centers: an expanded capacity-limited fixed cost location-allocation modeling approach," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(2), pages 218-229, April.
    12. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
    14. Jiamin Wang, 2007. "The (beta)-Reliable Median on a Network with Discrete Probabilistic Demand Weights," Operations Research, INFORMS, vol. 55(5), pages 966-975, October.
    15. Mingjian Wu & Tae J. Kwon & Karim El-Basyouny, 2020. "A Citywide Location-Allocation Framework for Driver Feedback Signs: Optimizing Safety and Coverage of Vulnerable Road Users," Sustainability, MDPI, vol. 12(24), pages 1-20, December.
    16. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    17. Jones, Dylan & Firouzy, Sina & Labib, Ashraf & Argyriou, Athanasios V., 2022. "Multiple criteria model for allocating new medical robotic devices to treatment centres," European Journal of Operational Research, Elsevier, vol. 297(2), pages 652-664.
    18. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    19. 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.
    20. Schilling, D. A. & Rosing, K. E. & ReVelle, C. S., 2000. "Network distance characteristics that affect computational effort in p-median location problems," European Journal of Operational Research, Elsevier, vol. 127(3), pages 525-536, December.

    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:jglopt:v:76:y:2020:i:1:d:10.1007_s10898-019-00834-6. 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.