 | Monter d'un niveau |
Aloise, D., & Hansen, P. (2009). A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering. Pesquisa Operacional, 29(3), 503-516. Disponible
Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009). NP-hardness of Euclidean sum-of-squares clustering. Machine Learning, 75(2), 245-248. Lien externe
Audet, C., Hansen, P., & Messine, F. (2009). External problems for convex polygons-an update. Dans Lectures on global optimization (p. 1-16). Lien externe
Audet, C., Hansen, P., & Messine, F. (2009). Ranking small regular polygons by area and by perimeter. Journal of Applied and Industrial Mathematics, 3(1), 21-27. Lien externe
Audet, C., Hansen, P., & Messine, F. (2009). La saga des trois petits octogones. Pour la science (380), 62-68. Non disponible
