33 citations · 132 across the 10 of their papers we have counts for
13 papers
Heuristic approaches for a new variant of the Team Orienteering Problem
Alberto Guastalla, Roberto Aringhieri, Pierre Hosteins
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…
The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes
Alberto Guastalla, Roberto Aringhieri, Pierre Hosteins
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 n…
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
Alberto Boggio Tomasaz, Margarida Carvalho, Roberto Cordone +1
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.…
Complexity of the Multilevel Critical Node Problem
Adel Nabli, Margarida Carvalho, Pierre Hosteins
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 defende…
The Stochastic Critical Node Problem over Trees
Pierre Hosteins, Rosario Scatamacchia
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 stoc…
Searching singlet extensions of the supersymmetric standard model in orbifold compactification of heterotic string
Marc Chemtob, Pierre Hosteins
We search for supersymmetric standard model realizations with extra singlets and extra using the heterotic string compactification on the orbifold with two Wils…