معرفی
Dr. Marcel Celaya serves as a Lecturer in Operational Research at Cardiff University's School of Mathematics. His academic position places him within one of the UK's leading mathematics departments, contributing to both teaching and research in theoretical optimization.
Dr. Celaya's research program centers on the theoretical foundations of integer programming and combinatorial optimization:
- Proximity and sparsity properties in integer optimization
- Structural analysis of mathematical programming problems
- Connections between optimization and algebraic structures
- Computational geometry aspects of discrete optimization
- Matroid theory applications in optimization
His publication record reveals a strong focus on theoretical aspects of integer programming, with particular attention to proximity bounds and sparsity properties. The research often involves international collaborations with optimization experts across European institutions, as evidenced by co-authorships with researchers from various universities. Dr. Celaya regularly contributes to the International Conference on Integer Programming and Combinatorial Optimization (IPCO), a premier venue in the field.
While specific teaching responsibilities aren't detailed in the available information, his position as Lecturer suggests active involvement in undergraduate and potentially graduate instruction within the mathematics curriculum at Cardiff University. His specialization in Operational Research indicates contributions to programs requiring advanced optimization methods and mathematical modeling.
