Paolo Paronuzzi
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
Paolo Paronuzzi has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Michele Monaci
DEI, University of Bologna, Bologna, Italy
6 shared publications - Enrico Malaguti
Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione “Guglielmo Marconi”, Università di Bologna, 40136 Bologna, Italy
5 shared publications - Henrik Schwaeppe
RWTH Aachen University
3 shared publications Albert Moser
2 shared publications- Demetrio Laganà
Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Italy
2 shared publications - Fabio Furini
Department of Computer, Control, and Management Engineering “Antonio Ruberti”, Sapienza University of Rome, 00185 Rome, Italy
2 shared publications
Latest Publications
- Open Access
- 6 October 2025
- Published by Springer Nature in Optimization Letters
- Vol. 20 (3) , 577-594
Algorithms and complexity results for the 0–1 knapsack problem with group fairness
This paper presents an exact algorithm for a generalisation of the classical 0–1 Knapsack Problem, called the Knapsack Problem with Group Fairness. In this problem, items are partitioned into classes, and fairness constraints affect the number of items that can or must be chosen from each class. The problem was introduced by Patel et al. (in: Dignum (eds) Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 2021), where approximation algorithms are discussed. This paper describes the first exact solution approaches for the Knapsack Problem with Group Fairness, based on integer linear programming formulations and a dynamic programming algorithm. The latter allows us to establish the complexity of the problem. Finally, a set of computational experiments on benchmark instances derived from the knapsack literature compare the effectiveness of the alternative solution approaches.
- 6 October 2025
- Published by Springer Nature in Optimization Letters
- Vol. 20 (3) , 577-594
Open AccessAlgorithms and complexity results for the 0–1 knapsack problem with group fairness
This paper presents an exact algorithm for a generalisation of the classical 0–1 Knapsack Problem, called the Knapsack Problem with Group Fairness. In this problem, items are partitioned into classes, and fairness constraints affect the number of items that can or must be chosen from each class. The problem was introduced by Patel et al. (in: Dignum (eds) Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 2021), where approximation algorithms are discussed. This paper describes the first exact solution approaches for the Knapsack Problem with Group Fairness, based on integer linear programming formulations and a dynamic programming algorithm. The latter allows us to establish the complexity of the problem. Finally, a set of computational experiments on benchmark instances derived from the knapsack literature compare the effectiveness of the alternative solution approaches.
- Open Access
- 13 August 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 329 (1) , 87-95
A multi-start local search matheuristic for the capacitated arc routing problem with irregular services
- 13 August 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 329 (1) , 87-95
Open AccessA multi-start local search matheuristic for the capacitated arc routing problem with irregular services
- Open Access
- 31 May 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 169
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem
- 31 May 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 169
Open AccessAn iterated local search matheuristic approach for the multi-vehicle inventory routing problem
- 15 June 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 205 (1-2) , 269-301
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- 15 June 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 205 (1-2) , 269-301
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70 (4) , 2399-2420
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
Exploiting Bilevel Optimization Techniques to Disconnect Graphs into Small Components In order to limit the spread of possible viral attacks in a communication or social network, it is necessary to identify critical nodes, the protection of which disconnects the remaining unprotected graph into a bounded number of shores (subsets of vertices) of limited cardinality. In the article “'Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem”, Furini, Ljubic, Malaguti, and Paronuzzi provide a new bilevel interpretation of the associated capacitated vertex separator problem and model it as a two-player Stackelberg game in which the leader interdicts (protects) the vertices, and the follower solves a combinatorial optimization problem on the resulting graph. Thanks to this bilevel interpretation, the authors derive different families of strengthening inequalities and show that they can be separated in polynomial time. The ideas exploited in their framework can also be extended to other vertex/edge deletion/insertion problems or graph partitioning problems by modeling them as two-player Stackelberg games to be solved through bilevel optimization.
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 70 (4) , 2399-2420
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
Exploiting Bilevel Optimization Techniques to Disconnect Graphs into Small Components In order to limit the spread of possible viral attacks in a communication or social network, it is necessary to identify critical nodes, the protection of which disconnects the remaining unprotected graph into a bounded number of shores (subsets of vertices) of limited cardinality. In the article “'Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem”, Furini, Ljubic, Malaguti, and Paronuzzi provide a new bilevel interpretation of the associated capacitated vertex separator problem and model it as a two-player Stackelberg game in which the leader interdicts (protects) the vertices, and the follower solves a combinatorial optimization problem on the resulting graph. Thanks to this bilevel interpretation, the authors derive different families of strengthening inequalities and show that they can be separated in polynomial time. The ideas exploited in their framework can also be extended to other vertex/edge deletion/insertion problems or graph partitioning problems by modeling them as two-player Stackelberg games to be solved through bilevel optimization.
- Open Access
- 22 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Generation and Transmission Expansion Planning With Respect to Global Warming Potential
As a result of global efforts to reduce greenhouse gas emissions, future energy system designs must be investigated. However, previous studies in integrated generation and transmission expansion planning neglect indirect emissions and therefore the full global warming potential of system designs. We introduce a linear, single-stage integrated expansion planning model with respect to global warming potential of all components. Neglecting indirect emissions underestimates the global warming potential by more than 20% and the total cost by almost 10% in an exemplary showcase. The inclusion of indirect emissions tightens the emission budget and therefore leads to different system designs.
- 22 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessGeneration and Transmission Expansion Planning With Respect to Global Warming Potential
As a result of global efforts to reduce greenhouse gas emissions, future energy system designs must be investigated. However, previous studies in integrated generation and transmission expansion planning neglect indirect emissions and therefore the full global warming potential of system designs. We introduce a linear, single-stage integrated expansion planning model with respect to global warming potential of all components. Neglecting indirect emissions underestimates the global warming potential by more than 20% and the total cost by almost 10% in an exemplary showcase. The inclusion of indirect emissions tightens the emission budget and therefore leads to different system designs.
- Open Access
- 21 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Requirements for Integrated Planning of Multi-Energy Systems
The successful realization of the climate goals agreed upon in the European Union’s COP21 commitments makes a fundamental change of the European energy system necessary. In particular, for a reduction of greenhouse gas emissions over 80%, the use of renewable energies must be increased not only in the electricity sector but also across all energy sectors, such as heat and mobility. Furthermore, a progressive integration of renewable energies increases the risk of congestions in the transmission grid and makes network expansion necessary. An efficient planning for future energy systems must comprise the coupling of energy sectors as well as interdependencies of generation and transmission grid infrastructure. However, in traditional energy system planning, these aspects are considered as decoupled. Therefore, the project PlaMES develops an approach for integrated planning of multi-energy systems on a European scale. This paper aims at analyzing the model requirements and describing the modeling approach.
- 21 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessRequirements for Integrated Planning of Multi-Energy Systems
The successful realization of the climate goals agreed upon in the European Union’s COP21 commitments makes a fundamental change of the European energy system necessary. In particular, for a reduction of greenhouse gas emissions over 80%, the use of renewable energies must be increased not only in the electricity sector but also across all energy sectors, such as heat and mobility. Furthermore, a progressive integration of renewable energies increases the risk of congestions in the transmission grid and makes network expansion necessary. An efficient planning for future energy systems must comprise the coupling of energy sectors as well as interdependencies of generation and transmission grid infrastructure. However, in traditional energy system planning, these aspects are considered as decoupled. Therefore, the project PlaMES develops an approach for integrated planning of multi-energy systems on a European scale. This paper aims at analyzing the model requirements and describing the modeling approach.
- 11 September 2020
- Published by Springer Nature in 4OR
- Vol. 19 (3) , 471-472
Models and algorithms for decomposition problems
- 11 September 2020
- Published by Springer Nature in 4OR
- Vol. 19 (3) , 471-472
Models and algorithms for decomposition problems
- Open Access
- 31 July 2019
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 12 (2) , 133-164
On integer and bilevel formulations for the k-vertex cut problem
- 31 July 2019
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 12 (2) , 133-164
Open AccessOn integer and bilevel formulations for the k-vertex cut problem