Pierre Hosteins

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 21

Top Topics

Mixed Integer Linear

Optimal Selection

Top Venues

Electron. Notes Discret. Math.

Comput. Oper. Res.

Publications

Alberto Boggio Tomasaz, Margarida Carvalho, Roberto Cordone, Pierre Hosteins
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy. CoRR (2024)
Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins
Constructive-destructive heuristics for the Safe Set Problem. Comput. Oper. Res. 159 (2023)
Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins
A combinatorial branch and bound for the safe set problem. Networks 81 (4) (2023)
Reza Shahin, Pierre Hosteins, Paola Pellegrini, Pierre-Olivier Vandanjon
A full factorial sensitivity analysis for a capacitated Flex-Route Transit system. MT-ITS (2023)
Adel Nabli, Margarida Carvalho, Pierre Hosteins
Complexity of the multilevel critical node problem. J. Comput. Syst. Sci. 127 (2022)
Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri
The Connected Critical Node Problem. Theor. Comput. Sci. 923 (2022)
Pierre Hosteins
A compact mixed integer linear formulation for safe set problems. Optim. Lett. 14 (8) (2020)
Pierre Hosteins, Rosario Scatamacchia
The stochastic critical node problem over trees. Networks 76 (3) (2020)
Adel Nabli, Margarida Carvalho, Pierre Hosteins
Complexity of the Multilevel Critical Node Problem. CoRR (2020)
Roberto Cordone, Pierre Hosteins
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput. Oper. Res. 102 (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)
Roberto Cordone, Pierre Hosteins, Giovanni Righini
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization. INFORMS J. Comput. 30 (1) (2018)
Pierre Hosteins, Rosario Scatamacchia
The Stochastic Critical Node Problem over Trees. CoRR (2018)
Roberto Aringhieri, Davide Duma, Andrea Grosso, Pierre Hosteins
Simple but effective heuristics for the 2-constraint bin packing problem. J. Heuristics 24 (3) (2018)
Pierre Hosteins, Roberto Cordone, Giovanni Righini
The Prize-collecting Scheduling Problem with Deadlines. Electron. Notes Discret. Math. 55 (2016)
Bernardetta Addis, Roberto Aringhieri, Andrea Grosso, Pierre Hosteins
Hybrid constructive heuristics for the critical node problem. Ann. Oper. Res. 238 (1-2) (2016)
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
A Genetic Algorithm for a class of Critical Node Problems. Electron. Notes Discret. Math. 52 (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)
Roberto Cordone, Pierre Hosteins, Giovanni Righini, Paolo Ravizza, Andrea Piselli
Optimal selection of contracts and work shifts in multi-skill call centers. EURO J. Comput. Optim. 2 (4) (2014)