Theo dõi
Pierre Hosteins
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
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
732016
Local search metaheuristics for the critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Networks 67 (3), 209-221, 2016
582016
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
552016
Gauge-top unification
P Hosteins, R Kappl, M Ratz, K Schmidt-Hoberg
Journal of High Energy Physics 2009 (07), 029, 2009
352009
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
332006
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
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
302019
VNS solutions for the critical node problem
R Aringhieri, A Grosso, P Hosteins, R Scatamacchia
Electronic Notes in Discrete Mathematics 47, 37-44, 2015
272015
Quantum corrections to the effective neutrino mass operator in a 5D MSSM
A Deandrea, P Hosteins, M Oertel, J Welzel
Physical Review D—Particles, Fields, Gravitation, and Cosmology 75 (11), 113005, 2007
222007
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
212019
Simple but effective heuristics for the 2-constraint bin packing problem
R Aringhieri, D Duma, A Grosso, P Hosteins
Journal of Heuristics 24, 345-357, 2018
192018
Integrating yards, network and optimisation models towards real-time rail freight yard operations| Integrazione di impianti merci, rete e modelli di ottimizzazione per l …
R Licciardello, N Adamko, S Deleplanque, P Hosteins, R Liu, P Pellegrini, ...
Ingegneria Ferroviaria 75 (6), 417-447, 2020
162020
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
162017
Train management in freight shunting yards: Formalisation and literature review
S Deleplanque, P Hosteins, P Pellegrini, J Rodriguez
IET Intelligent Transport Systems 16 (10), 1286-1305, 2022
142022
A survey of Flex-Route Transit problem and its link with Vehicle Routing Problem
R Shahin, P Hosteins, P Pellegrini, PO Vandanjon, L Quadrifoglio
Transportation Research Part C: Emerging Technologies 158, 104437, 2024
122024
A compact mixed integer linear formulation for safe set problems
P Hosteins
Optimization Letters 14 (8), 2127-2148, 2020
122020
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
102016
The stochastic critical node problem over trees
P Hosteins, R Scatamacchia
Networks 76 (3), 381-401, 2020
92020
A full factorial sensitivity analysis for a capacitated flex-route transit system
R Shahin, P Hosteins, P Pellegrini, PO Vandanjon
2023 8th International Conference on Models and Technologies for Intelligent …, 2023
82023
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20