Areas of competence (ACM CCS 2012)
Applied Computing • Operations Research
Math of computing • Discrete math • Graph theory • Graph algorithms
Math of computing • Discrete math • Combinatorics • Combinatorial optimization
Applied Computing • Operations Research
Math of computing • Discrete math • Graph theory • Graph algorithms
Math of computing • Discrete math • Combinatorics • Combinatorial optimization
Fabrizio Marinelli works with national and international research groups on topics that mainly include discrete optimization, with particular attention to cutting and packing problems. Over the years, he has promoted scientific collaborations by establishing cross-domain partnerships with researchers from UNIVPM and other Universities, including the Università degli Studi dell’Aquila (IT), Università degli studi del Sannio (IT), Università degli Studi di Napoli Federico II (IT), Politecnico di Milano (IT), Istituto di Analisi Sistemi ed Informatica IASI-CNR (IT), University of Graz (AT), Bilkent University (TR), Universidade do Minho (PT), École Polytechnique (FR), Chalmers University (SE), Nagoya University (JP), and Tampere University (FI). Since 2018, he has been in charge of the departmental research laboratory LORA - Lab. of Operations Research Applications
In 2011 and 2022, he was invited as a Senior Researcher at the LIX (Laboratoire d’Informatique) of the École Polytechnique, Palaiseau (F), where he conducted research on worst-case and approximation analysis of algorithms via mathematical programming.
He is a regular member of national and international scientific societies and working groups, including MIPS (Mixed-Integer Programming Society, a section of the Mathematical Optimization Society), SIAM (Society for Industrial and Applied Mathematics), SIMAI (Italian Society of Applied and Industrial Mathematics), INFORMS (The Institute for Operations Research and the Management Sciences), ESICUP (Working Group on Cutting and Packing within EURO - the Association of the European Operational Research Societies), and AIRO (Italian Society of Operations Research).
Over the past twenty years, Fabrizio Marinelli has regularly served as a reviewer for more than 25 international journals. He has been recognized as an Outstanding Reviewer for the European Journal of Operational Research and the International Journal of Production Economics, and as a Recognized Reviewer for Applied Mathematics and Computation, Computer Communications, Computers & Industrial Engineering, Computers & Operations Research, Discrete Applied Mathematics, and Omega - The International Journal of Management Science.
He was co-chair of the AIRO2002 conference and a member of the organizing committee of the 5th ESICUP Meeting. He also organized and chaired the invited sessions MILP in Manufacturing and Logistics at the 31th and 32th European Conference on Operational Research. Since 2017, he has been a member of the program committee of the ICORES conferences.
Fabrizio Marinelli has co-authored 33 papers published in international journals, 31 book chapters and conference proceedings, 60 short or extended abstracts presented at international conferences, and a few dissemination articles. His publications have received 895 citations overall, and his H-index is 16 (Scopus source at May 2026).
In 2009, the paper Cutting and Reusing: an Application from Automobile Component Manufacturing (Operations Research), of which Fabrizio Marinelli was a co-author, was ranked second for visibility and fourth for yield (first and second in Europe, respectively) in the worldwide section of the Eighth Rothkopf Ranking of Universities’ Contributions to the INFORMS Practice Literature (R.D. Fricker, Interface, 39 (6), 533 - 539).
In 2018, he was a member of the japanese-italian team (M. Yagiura, Y. Hu, O. Kanji from Nagoya University and F. Marinelli, A. Pizzuti from UNIVPM) that qualified for the finals (ranked first in Italy) of the ROADEF/EURO 2018 Challenge organized by ROADEF - Association Française de Recherche Opérationnelle et d’Aide à la Décision, www.roadef.org/challenge/2018/en/finalResults.php
His main research interests focus on discrete optimization, with particular emphasis on methodological and algorithmic aspects of decision problems arising in industrial contexts. Indeed, much of Fabrizio Marinelli’s scientific production is consistently focused on problems arising from real-world applications, with the aim of combining the methodological accuracy of the discipline with the complexity of practical cases. Alongside theoretical and methodological contributions, many of his works address or are inspired by decision problems in manufacturing and logistics settings. Such problems are mainly tackled through integer linear program decomposition and reformulation techniques, as well as heuristic approaches and exact algorithms. The proposed methods, most of which are based on Integer Linear Programming (ILP), address problems from both the primal (feasible solution) and dual (lower/upper bound) perspectives. Their design exploits a wide range of mathematical techniques, including polyhedral decomposition, dynamic column generation, variable fixing strategies, dual bound tightening, branching rule design, and symmetry handling.
The scientific production of Fabrizio Marinelli mainly lies in the classical yet still very active research area of Cutting & Packing problems, in particular focusing on the development of models and algorithms that integrate cut optimization with operational and/or tactical production planning decisions. However, his work also includes applications of mathematical programming and advanced optimization techniques in other, less traditional domains such as energy systems management and software engineering.
Fabrizio Marinelli promotes collaborations with businesses and has established close collaborations with major multinational companies and firms operating in Italy. In particular, since 1998 he has actively contributed to the technology transfer of techniques and methodologies in discrete optimization, with the role of scientific advisor, project coordinator, and senior software designer in more than 15 industrial projects involving leading companies such as Schnell Group , Luxottica Group , SCM Group, Micron Semiconductor Italia, Hydro Alluminium, Pilkington, Hay Group, and Dayco Europe.
F Marinelli, A Pizzuti, W Wu, and M Yagiura. One-dimensional bin packing with pattern-dependent processing time. European Journal of Operational Research, 2024.
C Arbib, F Marinelli, U Pferschy, and FK Ranjbar. One-dimensional stock cutting resilient against random defects. Computers & Operations Research, 2023.
C Arbib, F Marinelli, M Pinar, and A Pizzuti. Robust stock assortment and cutting under defects in automotive glass production. Production and Operations Management, 2022.
F Marinelli, A Pizzuti, and F Rossi. LP-based dual bounds for the maximum quasi-clique problem. Discrete Applied Mathematics, 2021.
C Arbib, F Marinelli, and A Pizzuti. Number of bins and maximum lateness minimization in two-dimensional bin packing. European Journal of Operational Research, 2021.
C Arbib and F Marinelli. Maximum lateness minimization in one-dimensional bin packing. Omega, 2017.
F Marinelli and A Parente. A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem. Computers & Operations Research, 2016.
L Liberti and F Marinelli. Mathematical programming: Turing completeness and applications to software analysis. Journal of Combinatorial Optimization, 2014.
C Arbib and F Marinelli. On Cutting Stock with Due Dates. Omega, 2014.
C Arbib, F Marinelli, and F Pezzella. An LP-based tabu search for batch scheduling in a cutting process with finite buffers. International Journal of Production Economics, 2012.
F Marinelli, S Nocella, F Rossi, and S Smriglio. A Lagrangian Heuristic for Satellite Range Scheduling with Resourse Constraints. Computers & Operations Research, 2011.
A Aloisio, C Arbib, and F Marinelli. Cutting Stock with No Three Parts per Pattern: Work-in-process and Pattern Minimization. Discrete Optimization, 2011.
A Aloisio, C Arbib, and F Marinelli. On LP Relaxations for the Pattern Minimization Problem. Networks, 2011.
C Arbib and F Marinelli. Exact and Asymptotically Exact Solutions for a Class of Assortment Problems. INFORMS Journal on Computing, 2009.
V Cortellessa, F Marinelli, and P Potena. An Optimization Framework for “Build-or-Buy” Decisions in Software Architecture. Computers & Operations Research, 2008.
C Arbib and F Marinelli. An Optimization Model for Trim Loss Minimization in an Automotive Glass Plant. European Journal of Operational Research, 2007.
C Arbib and F Marinelli. Integrating Process Optimization and Inventory Planning in Cutting-Stock with Skiving Option: an Optimization Model and its Application. European Journal of Operational Research, 2005.
C Arbib, F Di Iorio, F Marinelli, and F Rossi. Cutting and Reusing: an Application from Automobile Component Manufacturing. Operations Research, 2002.
Fabrizio Marinelli’s complete scientific production is available here