Rosario Scatamacchia

According to our database1, Rosario Scatamacchia authored at least 28 papers between 2015 and 2023.

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

2023
The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming.
INFORMS J. Comput., 2023

ITERATED INSIDE OUT: a new exact algorithm for the transportation problem.
CoRR, 2023

2022
The Connected Critical Node Problem.
Theor. Comput. Sci., 2022

Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions.
Comput. Ind. Eng., 2022

On fairness and diversification in WTA and ATP tennis tournaments generation.
Ann. Oper. Res., 2022

2021
The Baggage Belt Assignment Problem.
EURO J. Transp. Logist., 2021

Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop.
4OR, 2021

2020
The Longest Processing Time rule for identical parallel machines revisited.
J. Sched., 2020

The stochastic critical node problem over trees.
Networks, 2020

An exact approach for the bilevel knapsack problem with interdiction constraints and extensions.
Math. Program., 2020

An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem.
CoRR, 2020

2019
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem.
J. Comb. Optim., 2019

On approximating the Incremental Knapsack Problem.
Discret. Appl. Math., 2019

New exact approaches and approximation results for the Penalized Knapsack Problem.
Discret. Appl. Math., 2019

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.
Discret. Appl. Math., 2019

Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Approximating the 3-period Incremental Knapsack Problem.
J. Discrete Algorithms, 2018

Improved dynamic programming and approximation results for the knapsack problem with setups.
Int. Trans. Oper. Res., 2018

A new exact approach for the Bilevel Knapsack with Interdiction Constraints.
CoRR, 2018

2017
Knapsack Problems with Side Constraints.
PhD thesis, 2017

A new exact approach for the 0-1 Collapsing Knapsack Problem.
Eur. J. Oper. Res., 2017

Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem.
CoRR, 2017

An exact approach for the 0-1 knapsack problem with setups.
Comput. Oper. Res., 2017

Approximation Results for the Incremental Knapsack Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Local search metaheuristics for the critical node problem.
Networks, 2016

A preliminary analysis of the Distance Based Critical Node Problem.
Electron. Notes Discret. Math., 2016

A general Evolutionary Framework for different classes of Critical Node Problems.
Eng. Appl. Artif. Intell., 2016

2015
VNS solutions for the Critical Node Problem.
Electron. Notes Discret. Math., 2015


  Loading...