Optimal selection of contracts and work shifts in multi-skill call centers. - Roberto Cordone; Pierre Hosteins; Giovanni Righini; Paolo Ravizza; Andrea Piselli (EURO J. Comput. Optim., 2014)

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

Hybrid constructive heuristics for the critical node problem. - Bernardetta Addis; Roberto Aringhieri; Andrea Grosso; Pierre Hosteins (Ann. Oper. Res., 2016)

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 Genetic Algorithm for a class of Critical Node Problems. - Roberto Aringhieri; Andrea Grosso; Pierre Hosteins (Electron. Notes Discret. Math., 2016)

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

The Prize-collecting Scheduling Problem with Deadlines. - Pierre Hosteins; Roberto Cordone; Giovanni Righini (Electron. Notes Discret. Math., 2016)

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

Simple but effective heuristics for the 2-constraint bin packing problem. - Roberto Aringhieri; Davide Duma; Andrea Grosso; Pierre Hosteins (J. Heuristics, 2018)

A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization. - Roberto Cordone; Pierre Hosteins; Giovanni Righini (INFORMS J. Comput., 2018)

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. - Roberto Cordone; Pierre Hosteins (Comput. Oper. Res., 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)

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

A compact mixed integer linear formulation for safe set problems. - Pierre Hosteins (Optim. Lett., 2020)

Complexity of the multilevel critical node problem. - Adel Nabli; Margarida Carvalho; Pierre Hosteins (J. Comput. Syst. Sci., 2022)

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

A full factorial sensitivity analysis for a capacitated Flex-Route Transit system. - Reza Shahin; Pierre Hosteins; Paola Pellegrini; Pierre-Olivier Vandanjon (MT-ITS, 2023)

A combinatorial branch and bound for the safe set problem. - Alberto Boggio Tomasaz; Roberto Cordone; Pierre Hosteins (Networks, 2023)

Constructive-destructive heuristics for the Safe Set Problem. - Alberto Boggio Tomasaz; Roberto Cordone; Pierre Hosteins (Comput. Oper. Res., 2023)

On the completeness of several fortification-interdiction games in the Polynomial Hierarchy. - Alberto Boggio Tomasaz; Margarida Carvalho; Roberto Cordone; Pierre Hosteins (CoRR, 2024)

The team orienteering problem with service times and mandatory & incompatible nodes. - Alberto Guastalla; Roberto Aringhieri; Pierre Hosteins (Comput. Oper. Res., 2025)