Pierre Hosteins

24 papers Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Studies on the impact of the fixed-speed approximation for the real time Railway Traffic Management Problem.
J. Rail Transp. Plan. Manag.
Pierre Hosteins, Paola Pellegrini, Grégory Marlière, Joaquin Rodriguez
2025 J jnl
The team orienteering problem with service times and mandatory & incompatible nodes.
Comput. Oper. Res.
Alberto Guastalla, Roberto Aringhieri, Pierre Hosteins
2024 J jnl
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy.
CoRR
Alberto Boggio Tomasaz, Margarida Carvalho, Roberto Cordone, Pierre Hosteins
2023 J jnl
A combinatorial branch and bound for the safe set problem.
Networks
Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins
2023 — conf
A full factorial sensitivity analysis for a capacitated Flex-Route Transit system.
MT-ITS
Reza Shahin, Pierre Hosteins, Paola Pellegrini, Pierre-Olivier Vandanjon
2023 J jnl
Constructive-destructive heuristics for the Safe Set Problem.
Comput. Oper. Res.
Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins
2022 J jnl
Complexity of the multilevel critical node problem.
J. Comput. Syst. Sci.
Adel Nabli, Margarida Carvalho, Pierre Hosteins
2022 J jnl
The Connected Critical Node Problem.
Theor. Comput. Sci.
Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri
2020 J jnl
A compact mixed integer linear formulation for safe set problems.
Optim. Lett.
Pierre Hosteins
2020 J jnl
Complexity of the Multilevel Critical Node Problem.
CoRR
Adel Nabli, Margarida Carvalho, Pierre Hosteins
2020 J jnl
The stochastic critical node problem over trees.
Networks
Pierre Hosteins, Rosario Scatamacchia
2019 J jnl
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization.
Comput. Oper. Res.
Roberto Cordone, Pierre Hosteins
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 Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization.
INFORMS J. Comput.
Roberto Cordone, Pierre Hosteins, Giovanni Righini
2018 J jnl
Simple but effective heuristics for the 2-constraint bin packing problem.
J. Heuristics
Roberto Aringhieri, Davide Duma, Andrea Grosso, Pierre Hosteins
2018 J jnl
The Stochastic Critical Node Problem over Trees.
CoRR
Pierre Hosteins, Rosario Scatamacchia
2016 J jnl
A Genetic Algorithm for a class of Critical Node Problems.
Electron. Notes Discret. Math.
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins
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
Hybrid constructive heuristics for the critical node problem.
Ann. Oper. Res.
Bernardetta Addis, Roberto Aringhieri, Andrea Grosso, Pierre Hosteins
2016 J jnl
Local search metaheuristics for the critical node problem.
Networks
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
2016 J jnl
The Prize-collecting Scheduling Problem with Deadlines.
Electron. Notes Discret. Math.
Pierre Hosteins, Roberto Cordone, Giovanni Righini
2015 J jnl
VNS solutions for the Critical Node Problem.
Electron. Notes Discret. Math.
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia
2014 J jnl
Optimal selection of contracts and work shifts in multi-skill call centers.
EURO J. Comput. Optim.
Roberto Cordone, Pierre Hosteins, Giovanni Righini, Paolo Ravizza, Andrea Piselli