Rosario Scatamacchia

34 papers B 1C 1Journal 31

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