VNS solutions for the Critical Node Problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Electron. Notes Discret. Math., 2015)

A general Evolutionary Framework for different classes of Critical Node Problems. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Eng. Appl. Artif. Intell., 2016)

A preliminary analysis of the Distance Based Critical Node Problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Electron. Notes Discret. Math., 2016)

Local search metaheuristics for the critical node problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Networks, 2016)

Approximation Results for the Incremental Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (IWOCA, 2017)

An exact approach for the 0-1 knapsack problem with setups. - Federico Della Croce; Fabio Salassa; Rosario Scatamacchia (Comput. Oper. Res., 2017)

Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (CoRR, 2017)

A new exact approach for the 0-1 Collapsing Knapsack Problem. - Federico Della Croce; Fabio Salassa; Rosario Scatamacchia (Eur. J. Oper. Res., 2017)

Knapsack Problems with Side Constraints. - Rosario Scatamacchia (2017)

A new exact approach for the Bilevel Knapsack with Interdiction Constraints. - Federico Della Croce; Rosario Scatamacchia (CoRR, 2018)

Improved dynamic programming and approximation results for the knapsack problem with setups. - Ulrich Pferschy; Rosario Scatamacchia (Int. Trans. Oper. Res., 2018)

Approximating the 3-period Incremental Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (J. Discrete Algorithms, 2018)

Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. - Federico Della Croce; Rosario Scatamacchia (IPCO, 2019)

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins; Rosario Scatamacchia (Discret. Appl. Math., 2019)

New exact approaches and approximation results for the Penalized Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (Discret. Appl. Math., 2019)

On approximating the Incremental Knapsack Problem. - Federico Della Croce; Ulrich Pferschy; Rosario Scatamacchia (Discret. Appl. Math., 2019)

A tight linear time $$ frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{ max }$$ problem. - Federico Della Croce; Rosario Scatamacchia; Vincent T'kindt (J. Comb. Optim., 2019)

An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem. - Federico Della Croce; Marco Ghirardi; Rosario Scatamacchia (CoRR, 2020)

An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. - Federico Della Croce; Rosario Scatamacchia (Math. Program., 2020)

The stochastic critical node problem over trees. - Pierre Hosteins; Rosario Scatamacchia (Networks, 2020)

The Longest Processing Time rule for identical parallel machines revisited. - Federico Della Croce; Rosario Scatamacchia (J. Sched., 2020)

Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. - Arianna Alfieri; Shuyu Zhou; Rosario Scatamacchia; Steef L. van de Velde (4OR, 2021)

The Baggage Belt Assignment Problem. - David Pisinger; Rosario Scatamacchia (EURO J. Transp. Logist., 2021)

On fairness and diversification in WTA and ATP tennis tournaments generation. - Federico Della Croce; Gabriele Dragotto; Rosario Scatamacchia (Ann. Oper. Res., 2022)

Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions. - Federico Della Croce; Marco Ghirardi; Rosario Scatamacchia (Comput. Ind. Eng., 2022)

The Connected Critical Node Problem. - Pierre Hosteins; Rosario Scatamacchia; Andrea Grosso; Roberto Aringhieri (Theor. Comput. Sci., 2022)

ITERATED INSIDE OUT: a new exact algorithm for the transportation problem. - Roberto Bargetto; Federico Della Croce; Rosario Scatamacchia (CoRR, 2023)

The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. - Gabriele Dragotto; Rosario Scatamacchia (INFORMS J. Comput., 2023)