Covering a square with six circles by deterministic global optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année :

Covering a square with six circles by deterministic global optimization

(1) , (2) , (3)
1
2
3
Sonia Cafieri
Pierre Hansen
  • Fonction : Auteur

Résumé

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.
Fichier principal
Vignette du fichier
covering_6circles_HAL.pdf (237.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02023555 , version 1 (18-02-2019)

Identifiants

Citer

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⟩
43 Consultations
103 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More