Brigitte Jaumard mainly investigates Mathematical optimization, Algorithm, Combinatorics, Discrete mathematics and Linear programming. Her work on Integer programming, Bilevel optimization and Branch and bound is typically connected to Workload as part of general Mathematical optimization study, connecting several disciplines of science. She has researched Algorithm in several fields, including Theoretical computer science, Quadratic programming, Column generation, Probabilistic logic and Heuristics.
Her work on Polyhedron as part of general Combinatorics research is frequently linked to Nonlinear programming, French horn and Euclidean geometry, thereby connecting diverse disciplines of science. She interconnects CURE data clustering algorithm, Bounded function, Partition and Cluster analysis in the investigation of issues within Discrete mathematics. Her Linear programming research includes elements of Facility location problem, 1-center problem and Convex set.
The scientist’s investigation covers issues in Computer network, Distributed computing, Mathematical optimization, Column generation and Algorithm. Her research investigates the connection between Computer network and topics such as Dimensioning that intersect with issues in Network planning and design. In her research on the topic of Distributed computing, Telecommunications link is strongly related with Scheduling.
Mathematical optimization connects with themes related to Routing and wavelength assignment in her study. Her Column generation research is multidisciplinary, incorporating perspectives in Linear programming and Mesh networking. As a part of the same scientific family, she mostly works in the field of Algorithm, focusing on Probabilistic logic and, on occasion, Satisfiability.
Computer network, Distributed computing, Routing, Column generation and Provisioning are her primary areas of study. Her Computer network study combines topics from a wide range of disciplines, such as Network virtualization and Dimensioning. Her studies in Distributed computing integrate themes in fields like Network architecture, Network topology, Scheduling and Path protection.
Her Routing research is multidisciplinary, relying on both Resource, Mathematical optimization, Optical burst switching and Wavelength-division multiplexing. In general Mathematical optimization study, her work on Integer programming often relates to the realm of Separation, thereby connecting several areas of interest. Her Column generation research is multidisciplinary, incorporating elements of Path, Multiplexing and Frequency allocation.
Her primary areas of study are Distributed computing, Routing, Virtual network, Computer network and Mathematical optimization. The various areas that Brigitte Jaumard examines in her Distributed computing study include Column generation, Network topology, Provisioning and Network architecture. Her study in Routing is interdisciplinary in nature, drawing from both Routing and wavelength assignment, Collision avoidance and Fuel efficiency.
Her research integrates issues of Network virtualization, Data center and Server in her study of Virtual network. Her study in the field of Peer to peer computing and Live streaming is also linked to topics like Free rider problem. Her Mathematical optimization study focuses on Heuristics in particular.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
New branch-and-bound rules for linear bilevel programming
Pierre Hansen;Brigitte Jaumard;Gilles Savard.
Siam Journal on Scientific and Statistical Computing (1992)
New branch-and-bound rules for linear bilevel programming
Pierre Hansen;Brigitte Jaumard;Gilles Savard.
Siam Journal on Scientific and Statistical Computing (1992)
Cluster analysis and mathematical programming
Pierre Hansen;Brigitte Jaumard.
Mathematical Programming (1997)
Cluster analysis and mathematical programming
Pierre Hansen;Brigitte Jaumard.
Mathematical Programming (1997)
Algorithms for the maximum satisfiability problem
Pierre Hansen;Brigitte Jaumard.
Computing (1990)
Algorithms for the maximum satisfiability problem
Pierre Hansen;Brigitte Jaumard.
Computing (1990)
A generalized linear programming model for nurse scheduling
Brigitte Jaumard;Frédéric Semet;Tsevi Vovor.
European Journal of Operational Research (1998)
A generalized linear programming model for nurse scheduling
Brigitte Jaumard;Frédéric Semet;Tsevi Vovor.
European Journal of Operational Research (1998)
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
Charles Audet;Pierre Hansen;Brigitte Jaumard;Gilles Savard.
Mathematical Programming (2000)
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
Charles Audet;Pierre Hansen;Brigitte Jaumard;Gilles Savard.
Mathematical Programming (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
HEC Montréal
Ghent University
Polytechnique Montréal
Polytechnique Montréal
Concordia University
University of Liège
University of California, Davis
Khalifa University
Fluminense Federal University
Polytechnique Montréal
University of Göttingen
Keio University
University of Geneva
University of Cantabria
University of Arizona
Leibniz Association
University of Helsinki
Princeton University
The University of Texas at Arlington
University of Pannonia
University of the Basque Country
University of Western Ontario
University of Pittsburgh
University of Münster
Lund University
University of Michigan–Ann Arbor