Skip to Main content Skip to Navigation
Conference papers

Covering a square with six circles by deterministic global optimization

Abstract : We consider the problem of covering a square with exactly 6 identical circles of minimal radius. In the literature, a covering is presented by Melissen and Schuur, and conjectured to be optimal. We adress the problem proposing a mathematical programming formulation and solving it to global optimality. We prove that the conjectured optimal covering is indeed the global optimum.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Monday, February 18, 2019 - 9:27:38 PM
Last modification on : Wednesday, November 3, 2021 - 4:32:42 AM
Long-term archiving on: : Sunday, May 19, 2019 - 8:26:39 PM


Files produced by the author(s)



Sonia Cafieri, Pierre Hansen, Frédéric Messine. Covering a square with six circles by deterministic global optimization. LeGO 2018: 14th International Workshop on Global Optimization, Sep 2018, Leiden, Netherlands. pp.020024, ⟨10.1063/1.5089991⟩. ⟨hal-02023555⟩



Record views


Files downloads