Rosario Scatamacchia

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 31

Top Topics

Knapsack Problem

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Gabriele Dragotto, Rosario Scatamacchia
The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. INFORMS J. Comput. 35 (5) (2023)
Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia
ITERATED INSIDE OUT: a new exact algorithm for the transportation problem. CoRR (2023)
Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia
Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions. Comput. Ind. Eng. 168 (2022)
Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri
The Connected Critical Node Problem. Theor. Comput. Sci. 923 (2022)
Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia
On fairness and diversification in WTA and ATP tennis tournaments generation. Ann. Oper. Res. 316 (2) (2022)
David Pisinger, Rosario Scatamacchia
The Baggage Belt Assignment Problem. EURO J. Transp. Logist. 10 (2021)
Arianna Alfieri, Shuyu Zhou, Rosario Scatamacchia, Steef L. van de Velde
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. 4OR 19 (2) (2021)
Gabriele Dragotto, Rosario Scatamacchia
ZERO Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. CoRR (2021)
David Pisinger, Rosario Scatamacchia
The Baggage Belt Assignment Problem. CoRR (2020)
Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia
An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem. CoRR (2020)
Federico Della Croce, Rosario Scatamacchia
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Math. Program. 183 (1) (2020)
Federico Della Croce, Rosario Scatamacchia
The Longest Processing Time rule for identical parallel machines revisited. J. Sched. 23 (2) (2020)
Pierre Hosteins, Rosario Scatamacchia
The stochastic critical node problem over trees. Networks 76 (3) (2020)
Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem. J. Comb. Optim. 38 (2) (2019)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
New exact approaches and approximation results for the Penalized Knapsack Problem. Discret. Appl. Math. 253 (2019)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discret. Appl. Math. 253 (2019)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
On approximating the Incremental Knapsack Problem. Discret. Appl. Math. 264 (2019)
Federico Della Croce, Rosario Scatamacchia
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. IPCO (2019)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximating the Incremental Knapsack Problem. CoRR (2018)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms (2018)
Federico Della Croce, Rosario Scatamacchia
Longest Processing Time rule for identical parallel machines revisited. CoRR (2018)
Ulrich Pferschy, Rosario Scatamacchia
Improved dynamic programming and approximation results for the knapsack problem with setups. Int. Trans. Oper. Res. 25 (2) (2018)
Federico Della Croce, Rosario Scatamacchia
A new exact approach for the Bilevel Knapsack with Interdiction Constraints. CoRR (2018)
Pierre Hosteins, Rosario Scatamacchia
The Stochastic Critical Node Problem over Trees. CoRR (2018)
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
A new exact approach for the 0-1 Collapsing Knapsack Problem. Eur. J. Oper. Res. 260 (1) (2017)
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
An exact approach for the 0-1 knapsack problem with setups. Comput. Oper. Res. 80 (2017)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Approximation Results for the Incremental Knapsack Problem. IWOCA (2017)
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. CoRR (2017)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
A general Evolutionary Framework for different classes of Critical Node Problems. Eng. Appl. Artif. Intell. 55 (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
A preliminary analysis of the Distance Based Critical Node Problem. Electron. Notes Discret. Math. 55 (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
Local search metaheuristics for the critical node problem. Networks 67 (3) (2016)
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
VNS solutions for the Critical Node Problem. Electron. Notes Discret. Math. 47 (2015)