I started my Ph.D. in august 1999. I first began to study the theory of directed hypergraphs. Hypergraphs have different applications, one of them is that hypergraphs can be used to modelling dynamic networks. More precisely a hypergraph model for random time-dependent shortest paths can be formulated. Hence by finding shortest hyperpaths, we can find the minimum expected/min-max travel time of the dynamic network.
Courses: “Logical inference I” – Study group in logic inference concerning how the use of mathematical programming methods can be used in logic inference. “Seminar in Mathematical Programming” by Tage Bai Andersen.
Teaching: Student assistant in “Mathematics for economists” (Mat Ø – 2 classes).