Fabrizio Marinelli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fabrizio Marinelli has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Claudio Arbib
Università degli Studi dell’Aquila
12 shared publications - Andrea Pizzuti
Università Politecnica delle Marche
6 shared publications - Leo Liberti
LIX CNRS, Ecole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
4 shared publications Pasqualina Potena
University of Alcalá
4 shared publicationsVittorio Cortellessa
Università dell’Aquila
4 shared publications- Alessandro Aloisio
Università degli studi Internazionali di Roma
2 shared publications
Latest Publications
- Open Access
- 4 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 302
An ergonomic zone polyhedral representation-based mathematical program to prevent work-Related musculoskeletal risks
- 4 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 302
Open AccessAn ergonomic zone polyhedral representation-based mathematical program to prevent work-Related musculoskeletal risks
- 15 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (6) , 16938-16952
Design and Analysis of the Tail Sequence for Short LDPC- Coded Space Communications
According to some standards for satellite communications, the transmitted stream is divided into transmission units with variable length, for which detecting the termination is particularly relevant. This is the case of space TeleCommands (TCs), where coded data are usually preceded by a start sequence, and optionally followed by a tail sequence, forming the Communication Link Transmission Unit (CLTU). Regarding the choice of schemes for error correction, the Consultative Committee for Space Data Systems recommendations for TC synchronization and coding suggests to use, among others, two Low-Density Parity-Check (LDPC) codes: one (relatively) long and one short. Adopting the long LDPC code eliminates the need for a tail sequence, as the LDPC decoder always fails when overrunning the end of the CLTU, thus causing the decoding and detection process to stop. This, however, is not true when the short LDPC code is adopted, since its decoding might converge on a codeword even when the decoder input is not a noisy codeword. This makes it necessary to use a tail sequence that causes the decoder to fail regardless of its input. In this paper, we study the features required for such a sequence and propose some methods for its design. Our numerical results, obtained considering various detection approaches for the tail sequence, show that the overall TC rejection probability improves significantly when the proposed tail sequence is employed. Our simulations also show that, for moderate values of the Signal-to-Noise Ratio (SNR), with a properly designed tail sequence it is possible to obtain the same performance in terms of TC rejection probability using decoderbased detection and likelihood ratio test-based detection, with the former approach being less complex than the latter.
- 15 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (6) , 16938-16952
Design and Analysis of the Tail Sequence for Short LDPC- Coded Space Communications
According to some standards for satellite communications, the transmitted stream is divided into transmission units with variable length, for which detecting the termination is particularly relevant. This is the case of space TeleCommands (TCs), where coded data are usually preceded by a start sequence, and optionally followed by a tail sequence, forming the Communication Link Transmission Unit (CLTU). Regarding the choice of schemes for error correction, the Consultative Committee for Space Data Systems recommendations for TC synchronization and coding suggests to use, among others, two Low-Density Parity-Check (LDPC) codes: one (relatively) long and one short. Adopting the long LDPC code eliminates the need for a tail sequence, as the LDPC decoder always fails when overrunning the end of the CLTU, thus causing the decoding and detection process to stop. This, however, is not true when the short LDPC code is adopted, since its decoding might converge on a codeword even when the decoder input is not a noisy codeword. This makes it necessary to use a tail sequence that causes the decoder to fail regardless of its input. In this paper, we study the features required for such a sequence and propose some methods for its design. Our numerical results, obtained considering various detection approaches for the tail sequence, show that the overall TC rejection probability improves significantly when the proposed tail sequence is employed. Our simulations also show that, for moderate values of the Signal-to-Noise Ratio (SNR), with a properly designed tail sequence it is possible to obtain the same performance in terms of TC rejection probability using decoderbased detection and likelihood ratio test-based detection, with the former approach being less complex than the latter.
- 22 November 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 322 (3) , 770-782
One-dimensional bin packing with pattern-dependent processing time
- 22 November 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 322 (3) , 770-782
One-dimensional bin packing with pattern-dependent processing time
- Open Access
- 6 November 2023
- Published by Elsevier in Applied Energy
- Vol. 353
A novel approach for multi-stage investment decisions and dynamic variations in medium-term energy planning for multi-energy carriers community
- 6 November 2023
- Published by Elsevier in Applied Energy
- Vol. 353
Open AccessA novel approach for multi-stage investment decisions and dynamic variations in medium-term energy planning for multi-energy carriers community
- 2 September 2023
- Published by Springer Nature
- p. 1227-1241
Optimizing Shelters and Evacuation Paths Against Flood in Historic Urban Built Environments
- 2 September 2023
- Published by Springer Nature
- p. 1227-1241
Optimizing Shelters and Evacuation Paths Against Flood in Historic Urban Built Environments
- Open Access
- 15 May 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 157
One-dimensional stock cutting resilient against singular random defects
- 15 May 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 157
Open AccessOne-dimensional stock cutting resilient against singular random defects
- Open Access
- 1 November 2022
- Published by SAGE Publications in Production and Operations Management
- Vol. 31 (11) , 4154-4172
Robust stock assortment and cutting under defects in automotive glass production
We address an assortment‐and‐cutting problem arising in the glass industry. The objective is to provide minimum waste solutions that are robust against such raw material imperfections as those possibly occurring with float glass production technology. The stochastic realization of defects is modeled as a spatial Poisson point process. A mixed integer program in the classical vein of robust optimization is presented and tested on data taken from a real plant application. Defective final products must in any case be discarded as waste but, if a recourse strategy is adopted, faults in glass sheets can sometimes be recovered. Closed forms for the computation of faulty item probabilities are provided in simple cases, and obtained via Monte Carlo simulation in more complex ones. The computational results demonstrate the benefits of the robust approach in terms of the reduction of back‐orders and overproduction, thereby showing that recourse strategies can enable nonnegligible improvements. Encouraged by this result, the management is presently evaluating the possibility of adopting the proposed model in plant operation.
- 1 November 2022
- Published by SAGE Publications in Production and Operations Management
- Vol. 31 (11) , 4154-4172
Open AccessRobust stock assortment and cutting under defects in automotive glass production
We address an assortment‐and‐cutting problem arising in the glass industry. The objective is to provide minimum waste solutions that are robust against such raw material imperfections as those possibly occurring with float glass production technology. The stochastic realization of defects is modeled as a spatial Poisson point process. A mixed integer program in the classical vein of robust optimization is presented and tested on data taken from a real plant application. Defective final products must in any case be discarded as waste but, if a recourse strategy is adopted, faults in glass sheets can sometimes be recovered. Closed forms for the computation of faulty item probabilities are provided in simple cases, and obtained via Monte Carlo simulation in more complex ones. The computational results demonstrate the benefits of the robust approach in terms of the reduction of back‐orders and overproduction, thereby showing that recourse strategies can enable nonnegligible improvements. Encouraged by this result, the management is presently evaluating the possibility of adopting the proposed model in plant operation.
- 1 June 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 296, 118-140
LP-based dual bounds for the maximum quasi-clique problem
- 1 June 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 296, 118-140
LP-based dual bounds for the maximum quasi-clique problem
- 1 February 2018
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 64, 25-34
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing
- 1 February 2018
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 64, 25-34
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing
- 1 January 2018
- Published by INSTICC
- p. 31-37
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem
Cutting operations in manufacturing are characterized by practical requirements and utility criteria that usually increase the complexity of formulations or, even worse, are difficult to be modeled in terms of mathematical programming. However, disregarding or just simplifying those requirements often leads to solutions considered not attractive or even useless by the manufacturer. In this paper we consider a rich two-dimensional cutting stock problem that covers the whole specification of a family of wood cutting machines produced by a worldwide leader in industrial machinery manufacturing. A sequential value correction heuristic is implemented to minimize the employed stock area while reducing additional objective functions.
- 1 January 2018
- Published by INSTICC
- p. 31-37
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem
Cutting operations in manufacturing are characterized by practical requirements and utility criteria that usually increase the complexity of formulations or, even worse, are difficult to be modeled in terms of mathematical programming. However, disregarding or just simplifying those requirements often leads to solutions considered not attractive or even useless by the manufacturer. In this paper we consider a rich two-dimensional cutting stock problem that covers the whole specification of a family of wood cutting machines produced by a worldwide leader in industrial machinery manufacturing. A sequential value correction heuristic is implemented to minimize the employed stock area while reducing additional objective functions.