Brigitte Jaumard | Cloud Computing | Best Researcher Award

Published on by Database Scientist

Prof. Dr. Brigitte Jaumard | Cloud Computing | Best Researcher Award

Concordia University | Canada

Prof. Dr. Brigitte Jaumard is a preeminent authority in computer science and operations research, specializing in the optimization of communication networks and the application of artificial intelligence. As a Professor in the Department of Computer Science and Software Engineering at Concordia University, her distinguished career is marked by significant academic and industrial contributions. Her foundational education includes a Ph.D., awarded with highest honors, from École Nationale Supérieure des Télécommunications (ParisTech) and a Thèse d’habilitation from Université Pierre et Marie Curie. She has held prestigious appointments, including a Tier I Canada Research Chair (2001-2019), and impactful roles in industry such as Principal Data Scientist at Ericsson’s Global AI Accelerator and Scientific Director at the Computer Research Institute of Montreal (CRIM). Her pioneering research, supported by major grants from NSERC and MITACS, focuses on developing sophisticated models and algorithms for 5G/B5G networks, energy efficiency, and network virtualization. The exceptional impact and volume of her work are demonstrated by a remarkable citation count of over 11,130, an h-index of 46, and an i10-index of 179, alongside multiple best paper awards from leading IEEE conferences. A dedicated mentor to numerous graduate students and postdoctoral fellows, she also actively shapes her field through service on technical program committees, editorial boards, and national grant selection panels, solidifying her legacy as a leader who bridges foundational research with transformative industrial innovation.

Profile: Scopus | Google Scholar

Featured Publications

  • Hansen, P., Jaumard, B., & Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5), 1194–1217.

  • Hansen, P., & Jaumard, B. (1997). Cluster analysis and mathematical programming. Mathematical Programming, 79(1), 191–215.

  • Hansen, P., & Jaumard, B. (1990). Algorithms for the maximum satisfiability problem. Computing, 44(4), 279–303.

  • Jaumard, B., Semet, F., & Vovor, T. (1998). A generalized linear programming model for nurse scheduling. European Journal of Operational Research, 107(1), 1–18.

  • 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.

  • 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.

  • Hansen, P., & Jaumard, B. (1995). Lipschitz optimization. In C. A. Floudas & P. M. Pardalos (Eds.), Handbook of global optimization (pp. 407–493). Springer.

  • Du Merle, O., Hansen, P., Jaumard, B., & Mladenovic, N. (1999). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21(4), 1485–1505.