As the resulting optimization problem is a nonconvex quadratically constrained quadratic program, we devise a branch-and-bound method by exploiting the special structure of the formulation. The ...

On December 8, 2021, Kari Rantanen of the Constraint Reasoning and Optimization group successfully defended his doctoral thesis Optimization Algorithms for Learning Graphical Model Structures. M.Sc.

Kari Rantanen will defend his doctoral thesis on Optimization Algorithms for Learning Graphical Model Structures. The thesis a part of research done in the Department of Computer Science and in the ...