Author Info
Name
Affiliation
Papers
ROSARIO SCATAMACCHIA
Dipartimento di Automatica e Informatica, Politecnico di Torino, Turin, Italy
19
Collaborators
Citations 
PageRank 
13
58
7.66
Referers 
Referees 
References 
81
158
140
Search Limit
100158
Title
Citations
PageRank
Year
Dynamic Programming Algorithms And Lagrangian Lower Bounds For A Discrete Lot Streaming Problem In A Two-Machine Flow Shop00.342021
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions00.342020
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.10.352019
New exact approaches and approximation results for the Penalized Knapsack Problem.20.402019
Lower Bounds And A New Exact Approach For The Bilevel Knapsack With Interdiction Constraints00.342019
A tight linear time $$\frac{13}{12}$$1312-approximation algorithm for the $$P2 || C_{\max }$$P2||Cmax problem00.342019
A new exact approach for the Bilevel Knapsack with Interdiction Constraints.00.342018
The stochastic critical node problem over trees00.342018
Improved Dynamic Programming And Approximation Results For The Knapsack Problem With Setups60.482018
Approximating the 3-period Incremental Knapsack Problem.00.342018
Longest Processing Time rule for identical parallel machines revisited.00.342018
On approximating the Incremental Knapsack Problem10.372018
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem.20.442017
A new exact approach for the 0-1 Collapsing Knapsack Problem.40.442017
An exact approach for the 0-1 knapsack problem with setups.80.582017
A preliminary analysis of the Distance Based Critical Node Problem.00.342016
A general Evolutionary Framework for different classes of Critical Node Problems.110.522016
Local search metaheuristics for the critical node problem.130.562016
VNS solutions for the Critical Node Problem.100.482015