B
Brigitte Jaumard
Researcher at Concordia University
Publications - 463
Citations - 9196
Brigitte Jaumard is an academic researcher from Concordia University. The author has contributed to research in topics: Column generation & Routing (electronic design automation). The author has an hindex of 44, co-authored 455 publications receiving 8647 citations. Previous affiliations of Brigitte Jaumard include École Polytechnique de Montréal & Rutgers University.
Papers
More filters
Journal ArticleDOI
Cluster analysis and mathematical programming
Pierre Hansen,Brigitte Jaumard +1 more
TL;DR: In this article, a survey of clustering from a mathematical programming viewpoint is presented, focusing on solution methods, i.e., dynamic programming, graph theoretical algorithms, branch-and-bound, cutting planes, column generation and heuristics.
New Branch and Bound Rules for Linear Bilevel Programming
TL;DR: A new branch-and-bound algorithm for linear bilevel programming is proposed that uses necessary optimality conditions expressed in terms of tightness of the follower’s constraints to fathom or simplify subproblems, branch and obtain penalties similar to those used in mixed-integer programming.
Journal ArticleDOI
New branch-and-bound rules for linear bilevel programming
TL;DR: In this paper, a branch-and-bound algorithm for linear bilevel programming is proposed, where necessary optimality conditions expressed in terms of tightness of the follower's constraints are used to fathom or simplify subproblems, branch and obtain penalties similar to those used in mixed-integer programming.
Journal ArticleDOI
Algorithms for the maximum satisfiability problem
Pierre Hansen,Brigitte Jaumard +1 more
TL;DR: In this paper, different heuristics for the maximum 2-Satisfiability problem were compared with the approximation algorithms of Johnson and of Lieberherr for the general maximum satisfaction problem.