Follow
Pierre Hosteins
Title
Cited by
Cited by
Year
Local search metaheuristics for the critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Networks 67 (3), 209-221, 2016
452016
A general evolutionary framework for different classes of critical node problems
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Engineering Applications of Artificial Intelligence 55, 128-145, 2016
402016
Gauge-top unification
P Hosteins, R Kappl, M Ratz, K Schmidt-Hoberg
Journal of High Energy Physics 2009 (07), 029, 2009
372009
Hybrid constructive heuristics for the critical node problem
B Addis, R Aringhieri, A Grosso, P Hosteins
Annals of Operations Research 238 (1), 637-649, 2016
362016
Successful leptogenesis in SO (10) unification with a left–right symmetric seesaw mechanism
A Abada, P Hosteins, FX Josse-Michaux, S Lavignac
Nuclear physics B 809 (1-2), 183-217, 2009
322009
A new, direct link between the baryon asymmetry and neutrino masses
M Frigerio, P Hosteins, S Lavignac, A Romanino
Nuclear physics B 806 (1-2), 84-102, 2009
322009
Quark–lepton unification and eight-fold ambiguity in the left–right symmetric seesaw mechanism
P Hosteins, S Lavignac, CA Savoy
Nuclear Physics B 755 (1-3), 137-163, 2006
302006
Quantum corrections to the effective neutrino mass operator in a 5D MSSM
A Deandrea, P Hosteins, M Oertel, J Welzel
Physical Review D 75 (11), 113005, 2007
222007
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
R Cordone, P Hosteins
Computers & Operations Research 102, 130-140, 2019
182019
VNS solutions for the critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Electronic Notes in Discrete Mathematics 47, 37-44, 2015
172015
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Discrete Applied Mathematics 253, 103-121, 2019
142019
Simple but effective heuristics for the 2-constraint bin packing problem
R Aringhieri, D Duma, A Grosso, P Hosteins
Journal of Heuristics 24 (3), 345-357, 2018
142018
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
R Cordone, P Hosteins, G Righini
INFORMS Journal on Computing 30 (1), 168-180, 2017
132017
A genetic algorithm for a class of Critical Node Problems
R Aringhieri, A Grosso, P Hosteins
Electronic Notes in Discrete Mathematics 52, 359-366, 2016
82016
A preliminary analysis of the distance based critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Electronic Notes in Discrete Mathematics 55, 25-28, 2016
52016
Optimal selection of contracts and work shifts in multi-skill call centers
R Cordone, P Hosteins, G Righini, P Ravizza, A Piselli
EURO Journal on Computational Optimization 2 (4), 247-277, 2014
52014
A compact mixed integer linear formulation for safe set problems
P Hosteins
Optimization Letters 14 (8), 2127-2148, 2020
42020
The stochastic critical node problem over trees
P Hosteins, R Scatamacchia
Networks 76 (3), 381-401, 2020
42020
Searching singlet extensions of the supersymmetric standard model in Z 6− II orbifold compactification of heterotic string
M Chemtob, P Hosteins
The European Physical Journal C 68 (3), 539-559, 2010
42010
Integrating yards, network and optimisation models towards real-time rail freight yard operations
R Licciardello, N Adamko, S Deleplanque, P Hosteins, R Liu, P Pellegrini, ...
Ingegneria Ferroviaria 6, 417-440, 2020
32020
The system can't perform the operation now. Try again later.
Articles 1–20