![]() | 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
Aloise, D., Hansen, P., & Liberti, L. (2009). An Improved Column Generation Algorithm for Minimum Sum-of-squares Clustering. (Rapport technique n° G-2009-25). Lien externe
Audet, C., Belhaiza, S., & Hansen, P. (2009). A new sequence form approach for the enumeration of all extreme nash equilibria for extensive form games. International Game Theory Review, 11(4), 437-451. Lien externe
Audet, C., Fournier, X., Hansen, P., & Messine, F. (2009). A Note on Diameters of Point Sets. (Rapport technique n° G-2009-85). 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). Extremal problems for convex polygons - An update. Dans Pardalos, P. M., & Coleman, T. F. (édit.), Lectures on Global Optimization (Vol. 55, p. 1-16). Lien externe
Audet, C., Hansen, P., & Messine, F. (2009). Isoperimetric polygons of maximum width. Discrete & Computational Geometry, 41(1), 45-60. 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
Audet, C., Hansen, P., & Messine, F. (2009). Simple Polygons of Maximum Perimeter Contained in a Unit Disk. Discrete & Computational Geometry, 41(2), 208-215. Lien externe
Hansen, P., Hertz, A., Kilani, R., Marcotte, O., & Schindl, D. (2009). Average distance and maximum induced forest. Journal of Graph Theory, 60(1), 31-54. Lien externe