IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v23y2015i4p815-832.html
   My bibliography  Save this article

Optimal circle covering problems and their applications

Author

Listed:
  • Balázs Bánhelyi
  • Endre Palatinus
  • Balázs Lévai

Abstract

We study a special type of circle covering problem, the complete cover of polygons by not necessarily congruent circles with prescribed centres. We introduce a branch-and-bound algorithm which is able to check whether an actual set of circles covers a given polygon. Furthermore, we present a method capable of finding the optimal cover with arbitrary precision. These techniques are based on interval arithmetic, therefore our results are numerically reliable. To demonstrate the performance of the developed optimization method, we determine the optimal cover of the unit square and an irregular polygon. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • Balázs Bánhelyi & Endre Palatinus & Balázs Lévai, 2015. "Optimal circle covering problems and their applications," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 815-832, December.
    • Handle: RePEc:spr:cejnor:v:23:y:2015:i:4:p:815-832
    DOI: 10.1007/s10100-014-0362-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-014-0362-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-014-0362-7?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. T. Kubach & A. Bortfeldt & H. Gehring, 2009. "Parallel greedy algorithms for packing unequal circles into a strip or a rectangle," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 461-477, December.
    2. Riccardo Cambini & Claudio Sodini, 2008. "A computational comparison of some branch and bound methods for indefinite quadratic programs," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 139-152, June.
    3. L. Casado & I. García & B. Tóth & E. Hendrix, 2011. "On determining the cover of a simplex by spheres centered at its vertices," Journal of Global Optimization, Springer, vol. 50(4), pages 645-655, August.
    4. Elvira Antal & Tibor Csendes & János Virágh, 2013. "Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(4), pages 665-684, December.
    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. Botond Bertók & Tibor Csendes & Tibor Illés, 2015. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 811-813, December.
    2. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.
    3. Briskorn, Dirk & Dienstknecht, Michael, 2020. "Covering polygons with discs: The problem of crane selection and location on construction sites," Omega, Elsevier, vol. 97(C).
    4. Yusuf Kuvvetli, 2023. "A goal programming model for two-stage COVID19 test sampling centers location-allocation problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(1), pages 1-20, March.

    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. R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.
    2. Hifi, Mhand & Yousef, Labib, 2019. "A local search-based method for sphere packing problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 482-500.
    3. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.
    4. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    5. Yaohua He & Yong Wu, 2013. "Packing non-identical circles within a rectangle with open length," Journal of Global Optimization, Springer, vol. 56(3), pages 1187-1215, July.
    6. López, C.O. & Beasley, J.E., 2016. "A formulation space search heuristic for packing unequal circles in a fixed size circular container," European Journal of Operational Research, Elsevier, vol. 251(1), pages 64-73.
    7. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    8. Immanuel Bomze & Stefan Gollowitzer & E. Yıldırım, 2014. "Rounding on the standard simplex: regular grids for global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 243-258, July.
    9. Tibor Csendes & Tibor Jordán & Tamás Szántai, 2013. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(4), pages 663-664, 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:cejnor:v:23:y:2015:i:4:p:815-832. 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.