( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reoptimizing shortest paths: From state of the art to new recent perspectives.

, , , и . ICTON, стр. 1-5. IEEE, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Daniele Soroldoni

Daniele Silvestro

Daniele Palmisano

Daniele Suzzi

Daniele Pillitteri

 

Другие публикации лиц с тем же именем

A generalized shortest path tour problem with time windows., , , и . Comput. Optim. Appl., 83 (2): 593-614 (2022)Hybrid Metaheuristics for the Far From Most String Problem., , и . Hybrid Metaheuristics, том 7919 из Lecture Notes in Computer Science, стр. 174-188. Springer, (2013)On the Shortest Path Problems with Edge Constraints., , , и . ICTON, стр. 1-4. IEEE, (2020)The constrained shortest path tour problem., , , и . Comput. Oper. Res., (2016)A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem., , , и . J. Simulation, 16 (5): 480-493 (2022)On the fast solution of the p-center problem., , , и . ICTON, стр. 1-4. IEEE, (2017)A simheuristic Algorithm for solving an Integrated Resource Allocation and Scheduling Problem., , , , и . WSC, стр. 3340-3351. IEEE, (2018)An efficient exact approach for the constrained shortest path tour problem., , и . Optim. Methods Softw., 35 (1): 1-20 (2020)Efficient GRASP solution approach for the Prisoner Transportation Problem., , , и . Comput. Oper. Res., (мая 2023)The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm., , , и . Networks, 81 (2): 204-219 (марта 2023)