Monter d'un niveau |
Ce graphique trace les liens entre tous les collaborateurs des publications de {} figurant sur cette page.
Chaque lien représente une collaboration sur la même publication. L'épaisseur du lien représente le nombre de collaborations.
Utilisez la molette de la souris ou les gestes de défilement pour zoomer à l'intérieur du graphique.
Vous pouvez cliquer sur les noeuds et les liens pour les mettre en surbrillance et déplacer les noeuds en les glissant.
Enfoncez la touche "Ctrl" ou la touche "⌘" en cliquant sur les noeuds pour ouvrir la liste des publications de cette personne.
Audet, C., Hansen, P., Messine, F., & Ninin, J. (2013). The Small Octagons of Maximal Width. Discrete & Computational Geometry, 49(3), 589-600. Lien externe
Audet, C., Fournier, X., Hansen, P., & Messine, F. (2010). A Note on Diameters of Point Sets. Optimization Letters, 4(4), 585-595. 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., Balhaïza, 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., Hansen, P., & Messine, F. (2009). Simple Polygons of Maximum Perimeter Contained in a Unit Disk. Discrete & Computational Geometry, 41(2), 208-215. Lien externe
Audet, C., Hansen, P., & Messine, F. (2007). Extremal Problems for Convex Polygons. Journal of Global Optimization, 38(2), 163-179. Lien externe
Audet, C., Hansen, P., & Messine, F. (2007). The Small Octagon With Longest Perimeter. Journal of Combinatorial Theory, Series A, 114(1), 135-150. Lien externe
Audet, C., Belhaiza, S., & Hansen, P. (2006). Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games. Journal of Optimization Theory and Applications, 129(3), 349-372. Lien externe
Audet, C., Hansen, P., & Messine, F. (2006). Quatre petits octogones. MATAPLI, 108(1), 63-75. Lien externe
Audet, C., Carrizosa, E., & Hansen, P. (2004). An Exact Method for Fractional Goal Programming. Journal of Global Optimization, 29(1), 113-120. Lien externe
Audet, C., Hansen, P., Messine, F., & Perron, S. (2004). The Minimum Diameter Octagon With Unit-Length Sides: Vincze's Wife's Octagon Is Suboptimal. Journal of Combinatorial Theory, Series A, 108(1), 63-75. Lien externe
Audet, C., Brimberg, J., Hansen, P., Le Digabel, S., & Mladenovic, N. (2004). Pooling Problem: Alternate Formulations and Solution Methods. Management Science, 50(6), 761-776. Lien externe
Audet, C., Hansen, P., Messine, F., & Xiong, J. (2002). The largest small octagon. Journal of Combinatorial Theory, Series A, 98(1), 46-59. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2001). Enumeration of All Extreme Equilibria of Bimatrix Games. SIAM Journal on Scientific Computing, 23(1), 323-338. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming. Mathematical Programming, 87(1), 131-152. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Symmetrical Linear Maxmin Approach to Disjoint Bilinear Programming. Mathematical Programming, 85(3), 573-592. Lien externe
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (juillet 1998). Enumeration of all extreme equilibrum strategies of bimatrix games [Communication écrite]. 8th International Symposium on Dynamic Games and Applications, Maastricht, Netherlands. Non disponible
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1997). Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications, 93(2), 273-300. Lien externe
Chen, P. C., Hansen, P., Jaumard, B., & Hoang, T. (1998). Solution of the multisource Weber and conditional Weber problems by D.-C. programming. Operations Research, 46(4), 548-562. Lien externe
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (août 2007). Improving frequent subgraph mining in the presence of symmetry [Communication écrite]. 5th International Workshop on Mining and Learning with Graphs, Firenze, Italia. Lien externe
Douanya Ngueste, G.-B., Hansen, P., & Jaumard, B. (juillet 1995). Probabilistic satisfiability and decomposition [Communication écrite]. Symbolic and quantitative approaches to reasoning and uncertainty : European conference, ECSQARU '95, Fribourg, Switzerland. Lien externe
Gerber, M., Hansen, P., & Hertz, A. (2002). Extension of Turan's theorem to the 2-stability number. Graphs and Combinatorics, 18(3), 479-489. Lien externe
Gélinas, S., Hansen, P., Jaumard, B., & Hansen, P. (janvier 1993). A labeling algorithm for minimum sum of diameters partitioning of graphs [Communication écrite]. Partitioning data sets, New Brunswick, NJ. 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
Hansen, P., Ngai, E., Cheung, B., & Mladenovic, N. (2005). Analysis of Global K-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. Journal of Classification, 22(2), 287-310. Lien externe
Hansen, P., Jaumard, B., Meyer, C., Simeone, B., & Doring, V. (2003). Maximum Split Clustering Under Connectivity Constraints. Journal of Classification, 20(2), 143-180. Lien externe
Hansen, P., Jaumard, B., De Aragao, M. P., Chauny, F., & Perron, S. (2000). Probabilistic Satisfiability With Imprecise Probabilities. International Journal of Approximate Reasoning, 24(2-3), 171-189. Lien externe
Hansen, P., Jaumard, B., & Meyer, C. (1999). On Lower Bounds for Numbered Complete Graphs. Discrete Applied Mathematics, 94(1-3), 205-225. Lien externe
Hansen, P., Jaumard, B., & Mladenovic, N. (1998). Minimum Sum of Squares Clustering in a Low Dimensional Space. Journal of Classification, 15(1), 37-55. Lien externe
Hansen, P., Jaumard, B., & De Aragao, M. P. (1998). Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem. European Journal of Operational Research, 108(3), 671-683. Lien externe
Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79(1-3), 191-215. Lien externe
Hansen, P., Jaumard, B., Sachs, H., & Zheng, M. L. (1995). Finding a kekule structure in a benzenoid system in linear-time. Journal of Chemical Information and Computer Sciences, 35(3), 561-567. Lien externe
Hansen, P., Jaumard, B., Lebatteux, C., & Zheng, M. L. (1994). Coding chemical trees with the centered n-tuple code. Journal of Chemical Information and Computer Sciences, 34(4), 782-790. Lien externe
Hansen, P., Jaumard, B., & Xiong, J. (1994). Cord-slope form of Taylor's expansion in univariate global optimization. Journal of Optimization Theory and Applications, 80(3), 441-464. Lien externe
Merle, O. D., Hansen, P., Jaumard, B., & Mladenovic, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21(4), 1485-1505. Lien externe