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.
Cited literature [12 references]
https://hal-enac.archives-ouvertes.fr/hal-02023555
Contributor : Laurence Porte <>
Submitted on : Monday, February 18, 2019 - 9:27:38 PM
Last modification on : Tuesday, February 11, 2020 - 1:55:28 PM
Document(s) archivé(s) le : Sunday, May 19, 2019 - 8:26:39 PM
Contributor : Laurence Porte <>
Submitted on : Monday, February 18, 2019 - 9:27:38 PM
Last modification on : Tuesday, February 11, 2020 - 1:55:28 PM
Document(s) archivé(s) le : Sunday, May 19, 2019 - 8:26:39 PM
File
covering_6circles_HAL.pdf
Files produced by the author(s)
