معرفی
Eranda Dragoti-Cela is an Associate Professor at the Department of Optimization and Discrete Mathematics, Graz University of Technology. She specializes in combinatorial optimization, focusing on polynomially solvable special cases of NP-hard problems like the Quadratic Assignment Problem (QAP), portfolio optimization, and algorithmic graph theory.
- Education:
- M.Sc. in Applied Mathematics, University of Tirana (1992)
- Ph.D. in Technical Sciences, Graz University of Technology (1995)
- Habilitation in Applied Mathematics (2001)
Her research spans combinatorial optimization (QAP, assignment problems, location problems), portfolio optimization (risk-return models, ordinal information integration), and graph theory (edge intersection graphs, network flows). Recent work includes linearization of quadratic shortest path problems and data arrangement on trees.
She supervises bachelor's and master's theses in discrete mathematics and teaches courses like Combinatorial Optimization 1 and Risk Theory and Management, emphasizing algorithmic rigor and practical applications in finance and engineering.
