 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
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. External link
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. External link
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. External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1999). A Symmetrical Linear Maxmin Approach to Disjoint Bilinear Programming. Mathematical Programming, 85(3), 573-592. External link
Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1998, July). Enumeration of all extreme equilibrum strategies of bimatrix games [Paper]. 8th International Symposium on Dynamic Games and Applications, Maastricht, Netherlands. Unavailable
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. External link
Chen, P. C., Hansen, P., Jaumard, B., & Hoàng, T.ụ. (1998). Solution of the multisource Weber and conditional Weber problems by D.-C. programming. Operations Research, 46(4), 548-562. External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2007, August). Improving frequent subgraph mining in the presence of symmetry [Paper]. 5th International Workshop on Mining and Learning with Graphs, Firenze, Italia. External link
Gerber, M., Hansen, P., & Hertz, A. (2002). Extension of Turan's theorem to the 2-stability number. Graphs and Combinatorics, 18(3), 479-489. External link
Hansen, P., Ngai, E., Cheung, B., & Mladenović, N. (2005). Analysis of Global K-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. Journal of Classification, 22(2), 287-310. External link
Hansen, P., Jaumard, B., Meyer, C., Simeone, B., & Doring, V. (2003). Maximum Split Clustering Under Connectivity Constraints. Journal of Classification, 20(2), 143-180. External link
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. External link
Hansen, P., Jaumard, B., & Meyer, C. (1999). On Lower Bounds for Numbered Complete Graphs. Discrete Applied Mathematics, 94(1-3), 205-225. External link
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. External link
Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79(1-3), 191-215. External link
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. External link
