Paolo Paronuzzi

Orcid: 0000-0002-0001-8628

According to our database1, Paolo Paronuzzi authored at least 12 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Algorithms and complexity results for the 0-1 knapsack problem with group fairness.
Optim. Lett., April, 2026

A multi-start local search matheuristic for the capacitated arc routing problem with irregular services.
Eur. J. Oper. Res., 2026

2025
A computational study on Integer Programming formulations for Hop-constrained survivable network design.
Discret. Appl. Math., 2025

2024
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions.
Math. Program., May, 2024

An iterated local search matheuristic approach for the multi-vehicle inventory routing problem.
Comput. Oper. Res., 2024

2023
Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888].
Eur. J. Oper. Res., June, 2023

Scheduling of semi-automatic carousels with fixed production sequences.
Int. J. Prod. Res., February, 2023

2022
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem.
Oper. Res., 2022

2021
Models and algorithms for integrated production and distribution problems.
Comput. Ind. Eng., 2021

Models and algorithms for decomposition problems.
4OR, 2021

2020
On integer and bilevel formulations for the <i>k</i>-vertex cut problem.
Math. Program. Comput., 2020

2019
Integer optimization with penalized fractional values: The Knapsack case.
Eur. J. Oper. Res., 2019


  Loading...