Education:
1997: Ph.D. University of Calabria, Italy
Specialization: Systems Engineering and Informatics Dissertation: Parallel Algorithms for Large-Scale Network Optimization Problems
Advisor: L. Grandinetti
1993: Graduate (Laurea) Degree (summa cum laude) in Management Engineering, from University of Calabria, Italy
Dissertation: Parallel Algorithms for Network Flow Optimization Problems
Advisor: L. Grandinetti
Academic Positions:
2021 – present: Dean Department of Mechanical, Energy and Management Engineering, University of Calabria.
2015 – 2021: Vice Dean Department of Mechanical, Energy and Management Engineering, University of Calabria.
2013 – 2021: Management Engineering Graduate Program Coordinator, University of Calabria.
2019 - present: Vice-President of AIRO, the Italian Operations Research Society
2015 - present: Full professor of Operations Research, University of Calabria.
2010: Full Professorship in Operations Research at Polytechnic University of Marche, Italy
2002- 2015: Associate Professor of Operations Research, at University of Calabria, Rende, Italy
1999-2002: Assistant Professor of Operations Research, at University of Calabria, Rende, Italy
1998-1999: Postdoctoral Research Fellow (Top Talent Program), Department of Electronics, Computer Science and Systems, University of Calabria, Italy.
1999: Visiting Researcher at the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, MA, USA (Prof. Dimitri P. Bertsekas) Research topic “Solution Approaches for the Non-Linear Minimum Cost Flow Problem”
1995: Visiting Researcher at the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, MA, USA (Prof. Dimitri P. Bertsekas) Research topic “Auction Methods for the Linear Minimum Cost Flow Problem”
1993: Visiting Researcher at the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, MA, USA (Prof. Dimitri P. Bertsekas) Research topic “Efficient Solution Approaches on Sequential and Parallel Systems for the Shortest Path Problem”.
