Follow
Rosario Scatamacchia
Rosario Scatamacchia
Verified email at polito.it
Title
Cited by
Cited by
Year
A general evolutionary framework for different classes of critical node problems
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Engineering Applications of Artificial Intelligence 55, 128-145, 2016
682016
Local search metaheuristics for the critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Networks 67 (3), 209-221, 2016
572016
An exact approach for the 0–1 knapsack problem with setups
F Della Croce, F Salassa, R Scatamacchia
Computers & Operations Research 80, 61-67, 2017
422017
The longest processing time rule for identical parallel machines revisited
F Della Croce, R Scatamacchia
Journal of Scheduling 23 (2), 163-176, 2020
382020
Improved dynamic programming and approximation results for the knapsack problem with setups
U Pferschy, R Scatamacchia
International Transactions in Operational Research 25 (2), 667-682, 2018
372018
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
F Della Croce, R Scatamacchia
Mathematical Programming 183 (1), 249-281, 2020
262020
VNS solutions for the critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Electronic Notes in Discrete Mathematics 47, 37-44, 2015
232015
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Discrete Applied Mathematics 253, 103-121, 2019
212019
New exact approaches and approximation results for the penalized knapsack problem
F Della Croce, U Pferschy, R Scatamacchia
Discrete Applied Mathematics 253, 122-135, 2019
152019
On approximating the incremental knapsack problem
F Della Croce, U Pferschy, R Scatamacchia
Discrete Applied Mathematics 264, 26-42, 2019
142019
A new exact approach for the 0–1 collapsing knapsack problem
F Della Croce, F Salassa, R Scatamacchia
European Journal of Operational Research 260 (1), 56-69, 2017
142017
The zero regrets algorithm: Optimizing over pure Nash equilibria via integer programming
G Dragotto, R Scatamacchia
INFORMS Journal on Computing 35 (5), 1143-1160, 2023
102023
On fairness and diversification in WTA and ATP tennis tournaments generation
F Della Croce, G Dragotto, R Scatamacchia
Annals of Operations Research, 1-13, 2022
102022
Lower bounds and a new exact approach for the bilevel knapsack with interdiction constraints
F Della Croce, R Scatamacchia
Integer Programming and Combinatorial Optimization: 20th International …, 2019
82019
Approximating the 3-period incremental knapsack problem
F Della Croce, U Pferschy, R Scatamacchia
Journal of Discrete Algorithms 52, 55-69, 2018
82018
The stochastic critical node problem over trees
P Hosteins, R Scatamacchia
Networks 76 (3), 381-401, 2020
72020
A preliminary analysis of the distance based critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Electronic Notes in Discrete Mathematics 55, 25-28, 2016
72016
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
A Alfieri, S Zhou, R Scatamacchia, SL van de Velde
4OR 19, 265-288, 2021
62021
Guida alla valutazione economica di progetti di investimento nel settore dei trasporti
S Maffi
Franco Angeli, 2012
62012
A tight linear time -approximation algorithm for the problem
F Della Croce, R Scatamacchia, V T’kindt
Journal of Combinatorial Optimization 38, 608-617, 2019
52019
The system can't perform the operation now. Try again later.
Articles 1–20