Rosario Scatamacchia

Available identifiers

zbMath Open scatamacchia.rosarioMaRDI QIDQ510910

List of research outcomes

Publication	Date of Publication	Type
The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming	2024-03-22	Paper
The stochastic critical node problem over trees	2023-11-23	Paper
The connected critical node problem	2022-06-13	Paper
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop	2021-08-09	Paper
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions	2020-08-28	Paper
The longest processing time rule for identical parallel machines revisited	2020-04-22	Paper
Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints	2020-02-06	Paper
Intermittency in the relative separations of tracers and of heavy particles in turbulent flows	2019-07-11	Paper
A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem	2019-06-25	Paper
On approximating the incremental knapsack problem	2019-06-20	Paper
Approximating the 3-period incremental knapsack problem	2019-01-18	Paper
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem	2018-12-18	Paper
New exact approaches and approximation results for the penalized knapsack problem	2018-12-18	Paper
An exact approach for the 0-1 knapsack problem with setups	2018-07-11	Paper
Approximation results for the incremental knapsack problem	2018-06-15	Paper
A new exact approach for the 0-1 collapsing knapsack problem	2018-05-29	Paper
Improved dynamic programming and approximation results for the knapsack problem with setups	2018-05-22	Paper
A preliminary analysis of the distance based critical node problem	2017-02-14	Paper
VNS solutions for the critical node problem	2016-07-29	Paper

Research outcomes over time

This page was built for person: Rosario Scatamacchia