Fabrizio Rossi
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 Rossi has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Stefano Smriglio
DISIM University of L'Aquila Coppito (AQ) 67100 Italy
30 shared publications - Alessandro Agnetis
Università degli Studi di Siena
6 shared publications - Claudio Arbib
Università degli Studi dell’Aquila
5 shared publications - James Ostrowski
University of Tennessee
5 shared publications - Adam N. Letchford
Univ Lancaster, Dept Management Sci, Lancaster LA1 4YX, England
4 shared publications - Antonio Sassano
Sapienza Università di Roma
3 shared publications
Latest Publications
- Open Access
- 6 December 2025
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 18 (2) , 443-480
Application of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs
The Lovász theta function $$\theta (G)$$ provides a very good upper bound on the stability number of a graph G . It can be computed in polynomial time by solving a semidefinite program (SDP), which also turns out to be fairly tractable in practice. Consequently, $$\theta (G)$$ achieves a hard-to-beat trade-off between computational effort and strength of the bound. Indeed, several attempts to improve the theta bound are documented, mainly based on playing around the application of the $$N_+(\cdot )$$ lifting operator of Lovász and Schrijver to the classical formulation of the maximum stable set problem (SSP). Experience shows that solving such SDPs often struggles against practical intractability and requires highly specialized methods. We investigate the application of such an operator to two different linear formulations of the SSP based on clique and nodal inequalities, respectively. These two formulations are described by fewer inequalities than the natural formulation based on edge inequalities, yet they guarantee that the resulting SDP bound is at least as strong as $$\theta (G)$$ . Our computational experience, including larger graphs than those previously documented, shows that upper bounds stronger than $$\theta (G)$$ can be accessed by a reasonable additional effort using the clique-based formulation on sparse graphs and the nodal-based one on dense graphs.- 6 December 2025
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 18 (2) , 443-480
Open AccessApplication of the Lovász-Schrijver Operator to Compact Stable Set Integer Programs
The Lovász theta function $$\theta (G)$$ provides a very good upper bound on the stability number of a graph G . It can be computed in polynomial time by solving a semidefinite program (SDP), which also turns out to be fairly tractable in practice. Consequently, $$\theta (G)$$ achieves a hard-to-beat trade-off between computational effort and strength of the bound. Indeed, several attempts to improve the theta bound are documented, mainly based on playing around the application of the $$N_+(\cdot )$$ lifting operator of Lovász and Schrijver to the classical formulation of the maximum stable set problem (SSP). Experience shows that solving such SDPs often struggles against practical intractability and requires highly specialized methods. We investigate the application of such an operator to two different linear formulations of the SSP based on clique and nodal inequalities, respectively. These two formulations are described by fewer inequalities than the natural formulation based on edge inequalities, yet they guarantee that the resulting SDP bound is at least as strong as $$\theta (G)$$ . Our computational experience, including larger graphs than those previously documented, shows that upper bounds stronger than $$\theta (G)$$ can be accessed by a reasonable additional effort using the clique-based formulation on sparse graphs and the nodal-based one on dense graphs. - 1 May 2024
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 31 (5) , 416-428
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators
A Coding DNA Sequence (CDS) is a fraction of DNA whose nucleotides are grouped into consecutive triplets called codons, each one encoding an amino acid. Because most amino acids can be encoded by more than one codon, the same amino acid chain can be obtained by a very large number of different CDSs. These synonymous CDSs show different features that, also depending on the organism the transcript is expressed in, could affect translational efficiency and yield. The identification of optimal CDSs with respect to given transcript indicators is in general a challenging task, but it has been observed in recent literature that integer linear programming (ILP) can be a very flexible and efficient way to achieve it. In this article, we add evidence to this observation by proposing a new ILP model that simultaneously optimizes different well-grounded indicators. With this model, we efficiently find solutions that dominate those returned by six existing codon optimization heuristics.
- 1 May 2024
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 31 (5) , 416-428
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators
A Coding DNA Sequence (CDS) is a fraction of DNA whose nucleotides are grouped into consecutive triplets called codons, each one encoding an amino acid. Because most amino acids can be encoded by more than one codon, the same amino acid chain can be obtained by a very large number of different CDSs. These synonymous CDSs show different features that, also depending on the organism the transcript is expressed in, could affect translational efficiency and yield. The identification of optimal CDSs with respect to given transcript indicators is in general a challenging task, but it has been observed in recent literature that integer linear programming (ILP) can be a very flexible and efficient way to achieve it. In this article, we add evidence to this observation by proposing a new ILP model that simultaneously optimizes different well-grounded indicators. With this model, we efficiently find solutions that dominate those returned by six existing codon optimization heuristics.
- Open Access
- 28 July 2022
- Published by Springer Nature in Information Technology & Tourism
- Vol. 24 (3) , 409-434
Visitors flow management at Uffizi Gallery in Florence, Italy
We present a data-driven solution to manage visitors’ access at the Uffizi Gallery in Florence, Italy. The goal is to avoid the long lines outside the Museum, improving not only visitors’ experience, but also decency and security in the urban area. The solution implements a queue management system based on two data analytics models, one predictive and one prescriptive, which determine the entry time of each visitor. The system, which requires a minimal hardware and software infrastructure, was on the field from October 2018 to January 2020 during the most crowded visiting days, namely the free access days. First we report on the whole design and implementation process, then we show the solutions effectiveness and discuss the lesson learned.
- 28 July 2022
- Published by Springer Nature in Information Technology & Tourism
- Vol. 24 (3) , 409-434
Open AccessVisitors flow management at Uffizi Gallery in Florence, Italy
We present a data-driven solution to manage visitors’ access at the Uffizi Gallery in Florence, Italy. The goal is to avoid the long lines outside the Museum, improving not only visitors’ experience, but also decency and security in the urban area. The solution implements a queue management system based on two data analytics models, one predictive and one prescriptive, which determine the entry time of each visitor. The system, which requires a minimal hardware and software infrastructure, was on the field from October 2018 to January 2020 during the most crowded visiting days, namely the free access days. First we report on the whole design and implementation process, then we show the solutions effectiveness and discuss the lesson learned.
- Open Access
- 25 April 2022
- Published by Springer Nature in Soft Computing
- Vol. 27 (18) , 12943-12957
Comparing deep and shallow neural networks in forecasting call center arrivals
Forecasting volumes of incoming calls is the first step of the workforce planning process in call centers and represents a prominent issue from both research and industry perspectives. We investigate the application of Neural Networks to predict incoming calls 24 hours ahead. In particular, a Machine Learning deep architecture known as Echo State Network, is compared with a completely different rolling horizon shallow Neural Network strategy, in which the lack of recurrent connections is compensated by a careful input selection. The comparison, carried out on three different real world datasets, reveals better predictive performance for the shallow approach. The latter appears also more robust and less demanding, reducing the inference time by a factor of 2.5 to 4.5 compared to Echo State Networks.
- 25 April 2022
- Published by Springer Nature in Soft Computing
- Vol. 27 (18) , 12943-12957
Open AccessComparing deep and shallow neural networks in forecasting call center arrivals
Forecasting volumes of incoming calls is the first step of the workforce planning process in call centers and represents a prominent issue from both research and industry perspectives. We investigate the application of Neural Networks to predict incoming calls 24 hours ahead. In particular, a Machine Learning deep architecture known as Echo State Network, is compared with a completely different rolling horizon shallow Neural Network strategy, in which the lack of recurrent connections is compensated by a careful input selection. The comparison, carried out on three different real world datasets, reveals better predictive performance for the shallow approach. The latter appears also more robust and less demanding, reducing the inference time by a factor of 2.5 to 4.5 compared to Echo State Networks.
- 1 March 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 289 (2) , 485-494
Weak flow cover inequalities for the capacitated facility location problem
- 1 March 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 289 (2) , 485-494
Weak flow cover inequalities for the capacitated facility location problem
- 1 January 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Optimization
- Vol. 3 (2) , 139-153
Orbital Conflict: Cutting Planes for Symmetric Integer Programs
Cutting planes have been an important factor in the impressive progress made by integer programming (IP) solvers in the past two decades. However, cutting planes have had little impact on improving performance for symmetric IPs. Rather, the main breakthroughs for solving symmetric IPs have been achieved by cleverly exploiting symmetry in the enumeration phase of branch and bound. In this work, we introduce a hierarchy of cutting planes that arise from a reinterpretation of symmetry-exploiting branching methods. There are too many inequalities in the hierarchy to be used efficiently in a direct manner. However, the lowest levels of this cutting-plane hierarchy can be implicitly exploited by enhancing the conflict graph of the integer programming instance and by generating inequalities such as clique cuts valid for the stable set relaxation of the instance. We provide computational evidence that the resulting symmetry-powered clique cuts can improve state-of-the-art symmetry-exploiting methods. The inequalities are then employed in a two-phase approach with high-throughput computations to solve heretofore unsolved symmetric integer programs arising from covering designs, establishing for the first time the covering radii of two binary-ternary codes.
- 1 January 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Optimization
- Vol. 3 (2) , 139-153
Orbital Conflict: Cutting Planes for Symmetric Integer Programs
Cutting planes have been an important factor in the impressive progress made by integer programming (IP) solvers in the past two decades. However, cutting planes have had little impact on improving performance for symmetric IPs. Rather, the main breakthroughs for solving symmetric IPs have been achieved by cleverly exploiting symmetry in the enumeration phase of branch and bound. In this work, we introduce a hierarchy of cutting planes that arise from a reinterpretation of symmetry-exploiting branching methods. There are too many inequalities in the hierarchy to be used efficiently in a direct manner. However, the lowest levels of this cutting-plane hierarchy can be implicitly exploited by enhancing the conflict graph of the integer programming instance and by generating inequalities such as clique cuts valid for the stable set relaxation of the instance. We provide computational evidence that the resulting symmetry-powered clique cuts can improve state-of-the-art symmetry-exploiting methods. The inequalities are then employed in a two-phase approach with high-throughput computations to solve heretofore unsolved symmetric integer programs arising from covering designs, establishing for the first time the covering radii of two binary-ternary codes.
- 1 November 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 123
The stable set problem: Clique and nodal inequalities revisited
- 1 November 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 123
The stable set problem: Clique and nodal inequalities revisited
- 29 February 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 119, 104932
Codon optimization by 0-1 linear programming
- 29 February 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 119, 104932
Codon optimization by 0-1 linear programming
- Open Access
- 25 November 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (12) , 250
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish–start, here the task of a job cannot start before the task preceding it has started. We give polynomial exact algorithms for the following problems: a two-machine job shop with two jobs when recirculation is allowed (i.e., jobs can visit the same machine many times), a two-machine flow shop, and an m-machine flow shop with two jobs. We also point out some special cases whose complexity status is open.
- 25 November 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (12) , 250
Open AccessSome Results on Shop Scheduling with S-Precedence Constraints among Job Tasks
We address some special cases of job shop and flow shop scheduling problems with s-precedence constraints. Unlike the classical setting, in which precedence constraints among the tasks of a job are finish–start, here the task of a job cannot start before the task preceding it has started. We give polynomial exact algorithms for the following problems: a two-machine job shop with two jobs when recirculation is allowed (i.e., jobs can visit the same machine many times), a two-machine flow shop, and an m-machine flow shop with two jobs. We also point out some special cases whose complexity status is open.