Pierre Hosteins

Available identifiers

Publication	Date of Publication	Type
A combinatorial branch and bound for the safe set problem	2023-12-18	Paper
The stochastic critical node problem over trees	2023-11-23	Paper
Constructive-destructive heuristics for the safe set problem	2023-09-13	Paper
The connected critical node problem	2022-06-13	Paper
Complexity of the multilevel critical node problem	2022-04-04	Paper
A compact mixed integer linear formulation for safe set problems	2021-02-17	Paper
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization	2020-11-09	Paper
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem	2018-12-18	Paper
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization	2018-12-03	Paper
A preliminary analysis of the distance based critical node problem	2017-02-14	Paper
The prize-collecting scheduling problem with deadlines	2017-02-14	Paper
A genetic algorithm for a class of critical node problems	2016-10-18	Paper
VNS solutions for the critical node problem	2016-07-29	Paper
Hybrid constructive heuristics for the critical node problem	2016-04-20	Paper
Optimal selection of contracts and work shifts in multi-skill call centers	2015-01-28	Paper
Successful leptogenesis in \(SO(10)\) unification with a left-right symmetric seesaw mechanism	2010-08-06	Paper
A new, direct link between the baryon asymmetry and neutrino masses	2010-08-06	Paper

This page was built for person: Pierre Hosteins