Pierre Hosteins
YOU?
Author Swipe
View article: Studies on the impact of the fixed-speed approximation for the real time Railway Traffic Management Problem
Studies on the impact of the fixed-speed approximation for the real time Railway Traffic Management Problem Open
International audience
View article: Heuristic approaches for a new variant of the Team Orienteering Problem
Heuristic approaches for a new variant of the Team Orienteering Problem Open
In this paper we tackle the Team Orienteering Problem with Service Times, Mandatory Nodes and Incompatibilities, introduced in~\cite{Guastalla2024} and arising from two real-world healthcare applications. We propose two heuristic algorithm…
View article: The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes
The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes Open
The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes (TOP-ST-MIN) is a variant of the classic Team Orienteering Problem (TOP), which includes three novel features that stem from two real-world problems previo…
View article: On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy Open
Fortification-interdiction games are tri-level adversarial games where two opponents act in succession to protect, disrupt and simply use an infrastructure for a specific purpose. Many such games have been formulated and tackled in the lit…
View article: A full factorial sensitivity analysis for a capacitated Flex-Route Transit system
A full factorial sensitivity analysis for a capacitated Flex-Route Transit system Open
International audience
View article: A combinatorial branch and bound for the safe set problem
A combinatorial branch and bound for the safe set problem Open
The Weighted Safe Set Problem requires to partition an undirected graph into two families of connected components, respectively denoted as safe and unsafe, in such a way that each safe component dominates the unsafe adjacent components wit…
View article: Train management in freight shunting yards: Formalisation and literature review
Train management in freight shunting yards: Formalisation and literature review Open
This paper treats theoretical and practical aspects of train management in freight shunting yards. It is a literature survey extending the previous ones and presenting the new important papers published in the last decade. The operations r…
View article: Complexity of the Multilvel Critical Node Problem
Complexity of the Multilvel Critical Node Problem Open
In this work, we analyze a sequential game played in a graph called the Multilevel Critical Node problem (MCN). A defender and an attacker are the players of this game. The defender starts by preventively interdicting vertices (vaccination…
View article: A new framework for Mobility Allowance Shuttle Transit (MAST)
A new framework for Mobility Allowance Shuttle Transit (MAST) Open
31st European Conference on Operational Research, Athens, GRECE, 01-/06/2021 -
View article: The stochastic critical node problem over trees
The stochastic critical node problem over trees Open
We tackle a stochastic version of the critical node problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the outcome of attacks on nodes …
View article: Integrating yard, network and optimisation models towards real-time optimisation of rail freight yard operations
Integrating yard, network and optimisation models towards real-time optimisation of rail freight yard operations Open
International audience
View article: Local search metaheuristics for the critical node problem
Local search metaheuristics for the critical node problem Open
We present two metaheuristics for the Critical Node Problem, that is, the maximal fragmentation of a graph through the deletion of nodes. The two metaheuristics are based on the Iterated Local Search and Variable Neighborhood Search framew…