IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v84y2022i1d10.1007_s10898-022-01137-z.html
   My bibliography  Save this article

Covering a simplex by spheres: complexity and algorithms

Author

Listed:
  • Tongli Zhang

    (Beihang University)

  • Yong Xia

    (Beihang University)

Abstract

Simplex covering optimization problem (SCO) is modeled from the application of covering a simplex by m given balls. It contains the maximin dispersion problem as a special case. In this paper, we prove that (SCO) is NP-hard. We present an enumeration method (EM) to globally solve (SCO) and show that the complexity is strongly polynomial when m is fixed. Numerical experiments demonstrate that EM outperforms CPLEX when m is small. For larger m, we propose an efficient incomplete enumeration method based on linear programming relaxation.

Suggested Citation

  • Tongli Zhang & Yong Xia, 2022. "Covering a simplex by spheres: complexity and algorithms," Journal of Global Optimization, Springer, vol. 84(1), pages 119-135, September.
    • Handle: RePEc:spr:jglopt:v:84:y:2022:i:1:d:10.1007_s10898-022-01137-z
    DOI: 10.1007/s10898-022-01137-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01137-z
    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-022-01137-z?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. Siwen Wang & Zi Xu, 2021. "New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 524-539, August.
    2. Erkut, Erhan & Neuman, Susan, 1989. "Analytical models for locating undesirable facilities," European Journal of Operational Research, Elsevier, vol. 40(3), pages 275-291, June.
    3. B. Dasarathy & Lee J. White, 1980. "A Maxmin Location Problem," Operations Research, INFORMS, vol. 28(6), pages 1385-1401, December.
    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. Munoz-Perez, Jose & Saameno-Rodriguez, Juan Jose, 1999. "Location of an undesirable facility in a polygonal region with forbidden zones," European Journal of Operational Research, Elsevier, vol. 114(2), pages 372-379, April.
    2. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    3. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    4. Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    5. Romero-Morales, Dolores & Carrizosa, Emilio & Conde, Eduardo, 1997. "Semi-obnoxious location models: A global optimization approach," European Journal of Operational Research, Elsevier, vol. 102(2), pages 295-301, October.
    6. Aringhieri, Roberto & Cordone, Roberto & Grosso, Andrea, 2015. "Construction and improvement algorithms for dispersion problems," European Journal of Operational Research, Elsevier, vol. 242(1), pages 21-33.
    7. Andreas Löhne & Andrea Wagner, 2017. "Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver," Journal of Global Optimization, Springer, vol. 69(2), pages 369-385, October.
    8. Lili Mei & Deshi Ye & Yong Zhang, 2018. "Approximation strategy-proof mechanisms for obnoxious facility location on a line," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 549-571, August.
    9. H. W. Hamacher & S. Nickel, 1995. "Restricted planar location problems and applications," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 967-992, September.
    10. Paul Berglund & Changhyun Kwon, 2014. "Robust Facility Location Problem for Hazardous Waste Transportation," Networks and Spatial Economics, Springer, vol. 14(1), pages 91-116, March.
    11. Yapicioglu, Haluk & Smith, Alice E. & Dozier, Gerry, 2007. "Solving the semi-desirable facility location problem using bi-objective particle swarm," European Journal of Operational Research, Elsevier, vol. 177(2), pages 733-749, March.
    12. Mete Suleyman & Cil Zeynel Abidin & Özceylan Eren, 2018. "Location and Coverage Analysis of Bike- Sharing Stations in University Campus," Business Systems Research, Sciendo, vol. 9(2), pages 80-95, July.
    13. González, Javier Serrano & Gonzalez Rodriguez, Angel G. & Mora, José Castro & Santos, Jesús Riquelme & Payan, Manuel Burgos, 2010. "Optimization of wind farm turbines layout using an evolutive algorithm," Renewable Energy, Elsevier, vol. 35(8), pages 1671-1681.
    14. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.
    15. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
    16. 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.
    17. O Berman & Q Wang, 2007. "Locating semi-obnoxious facilities with expropriation: minisum criterion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 378-390, March.
    18. Caballero, Rafael & Gonzalez, Mercedes & Guerrero, Flor M & Molina, Julian & Paralera, Concepcion, 2007. "Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1751-1763, March.
    19. Skriver, Anders J. V. & Andersen, Kim Allan, 2003. "The bicriterion semi-obnoxious location (BSL) problem solved by an [epsilon]-approximation," European Journal of Operational Research, Elsevier, vol. 146(3), pages 517-528, May.
    20. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.

    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:84:y:2022:i:1:d:10.1007_s10898-022-01137-z. 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.