HOSTEINS, Pierre

HOSTEINS, Pierre  

INFORMATICA  

Mostra records
Risultati 1 - 20 di 22 (tempo di esecuzione: 0.029 secondi).
Titolo Data di pubblicazione Autore(i) File
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization 2019 Cordone R.; Hosteins P.
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization 2018 Cordone R.; Hosteins P.; Righini G.
A combinatorial branch and bound for the safe set problem 2023 Boggio Tomasaz A.; Cordone R.; Hosteins P.
A compact mixed integer linear formulation for safe set problems 2020 Hosteins P.
A full factorial sensitivity analysis for a capacitated Flex-Route Transit system 2023 Shahin R.; Hosteins P.; Pellegrini P.; Vandanjon P.-O.
A General Evolutionary Framework for different classes of Critical Node Problems 2016 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario
A Genetic Algorithm for a class of Critical Node Problems 2016 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
A preliminary analysis of the Distance Based Critical Node Problem 2016 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario
A survey of Flex-Route Transit problem and its link with Vehicle Routing Problem 2024 Shahin R.; Hosteins P.; Pellegrini P.; Vandanjon P.-O.; Quadrifoglio L.
Complexity of the multilevel critical node problem 2022 Nabli A.; Carvalho M.; Hosteins P.
Constructive–destructive heuristics for the Safe Set Problem 2023 Boggio Tomasaz A.; Cordone R.; Hosteins P.
Hybrid constructive heuristics for the critical node problem 2016 Addis, Bernardetta; Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
Integrating yards, network and optimisation models towards real-time rail freight yard operations|Integrazione di impianti merci, rete e modelli di ottimizzazione per l’esercizio in tempo reale degli impianti 2020 Licciardello R.; Adamko N.; Deleplanque S.; Hosteins P.; Liu R.; Pellegrini P.; Peterson A.; Wahlborg M.; Za'tko M.
Local Search Metaheuristics for the Critical Node Problem 2016 R. Aringhieri; A. Grosso; P. Hosteins; R. Scatamacchia
Optimal selection of contracts and work shifts in multi-skill call centers 2014 Cordone R.; Hosteins P.; Righini G.; Ravizza P.; Piselli A.
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem 2019 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre*; Scatamacchia, Rosario
Simple but effective heuristics for the 2-Constraint Bin Packing Problem 2018 Aringhieri, Roberto; Duma, Davide; Grosso, Andrea; Hosteins, Pierre
The Connected Critical Node Problem 2022 Hosteins P.; Scatamacchia R.; Grosso A.; Aringhieri R.
The Prize-collecting Scheduling Problem with Deadlines 2016 Hosteins P.; Cordone R.; Righini G.
The stochastic critical node problem over trees 2020 Hosteins P.; Scatamacchia R.