E-LIB Suche - Ergebnisse für: Hosteins, Pierre

1

A survey of Flex-Route Transit problem and its link with Ve..:

Shahin, Reza ; Hosteins, Pierre ; Pellegrini, Paola..
Transportation Research Part C: Emerging Technologies. 158 (2024) - p. 104437 , 2024

Link: https://doi.org/10.1016/..

2

Constructive–destructive heuristics for the Safe Set Proble:

Boggio Tomasaz, Alberto ; Cordone, Roberto ; Hosteins, Pierre
Computers & Operations Research. 159 (2023) - p. 106311 , 2023

Link: https://doi.org/10.1016/..

3

A full factorial sensitivity analysis for a capacitated Fle..:

, In: 2023 8th International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS),

Shahin, Reza ; Hosteins, Pierre ; Pellegrini, Paola. - p. 1-6 , 2023

Link: https://doi.org/10.1109/..

4

Complexity of the multilevel critical node problem:

Nabli, Adel ; Carvalho, Margarida ; Hosteins, Pierre
Journal of Computer and System Sciences. 127 (2022) - p. 122-145 , 2022

Link: https://doi.org/10.1016/..

5

A combinatorial branch and bound for the safe set problem:

Boggio Tomasaz, Alberto ; Cordone, Roberto ; Hosteins, Pierre
Networks. 81 (2022) 4 - p. 445-464 , 2022

Link: https://doi.org/10.1002/..

6

The Connected Critical Node Problem:

Hosteins, Pierre ; Scatamacchia, Rosario ; Grosso, Andrea.
Theoretical Computer Science. 923 (2022) - p. 235-255 , 2022

Link: https://doi.org/10.1016/..

7

Train management in freight shunting yards: Formalisation a..:

Deleplanque, Samuel ; Hosteins, Pierre ; Pellegrini, Paola.
IET Intelligent Transport Systems. 16 (2022) 10 - p. 1286-1305 , 2022

Link: https://doi.org/10.1049/..

8

A compact mixed integer linear formulation for safe set pro..:

Hosteins, Pierre
Optimization Letters. 14 (2020) 8 - p. 2127-2148 , 2020

Link: https://doi.org/10.1007/..

9

The stochastic critical node problem over trees:

Hosteins, Pierre ; Scatamacchia, Rosario
Networks. 76 (2020) 3 - p. 381-401 , 2020

Link: https://doi.org/10.1002/..

10

A bi-objective model for the single-machine scheduling prob..:

Cordone, Roberto ; Hosteins, Pierre
Computers & Operations Research. 102 (2019) - p. 130-140 , 2019

Link: https://doi.org/10.1016/..

11

Polynomial and pseudo-polynomial time algorithms for differ..:

Aringhieri, Roberto ; Grosso, Andrea ; Hosteins, Pierre.
Discrete Applied Mathematics. 253 (2019) - p. 103-121 , 2019

Link: https://doi.org/10.1016/..

12

A Branch-and-Bound Algorithm for the Prize-Collecting Singl..:

Cordone, Roberto ; Hosteins, Pierre ; Righini, Giovanni
INFORMS Journal on Computing. 30 (2018) 1 - p. 168-180 , 2018

Link: https://doi.org/10.1287/..

13

Simple but effective heuristics for the 2-constraint bin pa..:

Aringhieri, Roberto ; Duma, Davide ; Grosso, Andrea.
Journal of Heuristics. 24 (2017) 3 - p. 345-357 , 2017

Link: https://doi.org/10.1007/..

14

Hybrid constructive heuristics for the critical node proble:

Addis, Bernardetta ; Aringhieri, Roberto ; Grosso, Andrea.
Annals of Operations Research. 238 (2016) 1-2 - p. 637-649 , 2016

Link: https://doi.org/10.1007/..

15

A general Evolutionary Framework for different classes of C..:

Aringhieri, Roberto ; Grosso, Andrea ; Hosteins, Pierre.
Engineering Applications of Artificial Intelligence. 55 (2016) - p. 128-145 , 2016

Link: https://doi.org/10.1016/..