Luca Mencarelli, PhD.
 |
Research Fellow at E-mail: luca.mencarelli [@] unipi [DOT] it |
Education
I received B.S. and M.Sc. degrees in Industrial Engineering and Management Science from La Sapienza, University of Rome, in 2010 and 2013, respectively.
In December 2017, I received the PhD degree in Computer Science under the supervision of Prof. Leo Liberti and Prof. Claudia D’Ambrosio at LIX, Laboratoire d’Informatique de l’École Polytechnique, Paris (Thesis: The Multiplicative Weights Update Algorithm for Mixed Integer NonLinear Programming: Theory, Applications, and Limitations).
Professional Experiences
I have been Postdoctoral fellow at IFP Energies nouvelles (topic: Process synthesis and optimization: development and evaluation of approaches coupling simulation and optimization techniques) under the supervision of Alexandre Pagot.
Moreover, I have been Postdoctoral fellow at CERMICS, École des Ponts (topic: Matrix factorization for Time Series) under the supervision of Prof. Yohann De Castro.
Finally, I have been Postdoctoral fellow at UMA, ENSTA Paris (topic: QP/NLP-based Branch-and-Bound Framework) under the supervision of Prof. Sourour Elloumi.
Teaching Experiences
Discrete Optimization, ENSTA Paris, Palaiseau (France) for the academic year 2022-2023
Operations Research, University of Pisa, Pisa (Italy) for the academic year 2023-2024
Research
My research interests include:
Mixed Integer Nonlinear Programming
Portfolio Selection Applications
Chemical Superstructure Optimization
Nonnegative Matrix Factorization
List of Publications
L. Mencarelli, J. Floquet. Decomposition-based heuristic approaches for the satellite constellation design problem. Engineering Optimization (accepted), 2024.
A. Frangioni, L. Galli, L. Mencarelli. Delay Constrained Routing: the Multi-Flow Single-Path Case. AIRO-ODS 2024 (accepted), 2024.
L. Mencarelli. MWU 2.0 with Approximation Guarantee for the Distance Geometry Problem. Optimization and Decision Science: Operations Research, Inclusion and Equity, AIRO Series 9, pp. 71–81, Springer, Cham, 2023.
L. Mencarelli, J. Floquet, F. Georges. Matheuristics approaches for the satellite constellation design problem. Optimization and Engineering, pp. 1-17, 2023.
L. Mencarelli, J. Floquet, F. Georges, D. Grenier. Mixed Integer (Non)Linear Approaches for the Satellite Constellation Design Problem. Optimization and Engineering, pp. 1-22, 2022.
L. Mencarelli, A. Pagot. A Mixed Integer Nonlinear Approach for the Automated Superstructure Generation Problem. Computer Aided Chemical Engineering, 40, pp. 727–732, 2020.
P. Duchêne, L. Mencarelli, and A. Pagot. Optimization Approaches to the Integrated System of Catalytic Reforming and Isomerization Processes in Petroleum Refinery. Computers & Chemical Engineering, 141, 2020.
L. Mencarelli, Q. Chen, A. Pagot, and I.E. Grossmann. A Review on Superstructure Optimization Approaches in Process System Engineering. Computers & Chemical Engineering, 136, 2020.
L. Mencarelli, A. Pagot, and P. Duchêne. Surrogate-based Modeling Techniques with Application to Catalytic Reforming and Isomerization Processes. Computers & Chemical Engineering, 135, 2020.
L. Mencarelli, and C. D’Ambrosio. Complex Portfolio Selection via Convex Mixed-Integer Quadratic Programming: A Survey. International Transactions in Operational Research, 26(2), pp. 389-414, 2019.
L. Mencarelli. The Multiplicative Weights Update Algorithm for Mixed Integer NonLinear Programming: Theory, Applications, and Limitations. A Quarterly Journal of Operations Research, 16(3), pp. 341-342, 2018.
C. D’Ambrosio, S. Martello, and L. Mencarelli. Relaxations and Heuristics for the General Multiple Non-linear Knapsack Problem. Computer & Operations Research, 93, pp. 79-89, 2018.
L. Mencarelli, Y. Sahraoui, and L. Liberti. A Multiplicative Weights Update Algorithm for MINLP. EURO Journal of Computational Optimization, 5 (1-2), pp. 31-86, 2017.
L. Mencarelli, C. D’Ambrosio, A. Di Zio, S. Martello, Heuristics for the General Multiple Nonlinear Knapsack Problem. Electronic Notes in Discrete Mathematics, 55, pp. 69–72, 2016.