( en | de | ru )

 

Disambiguation of "Ferone, Daniele"

Author of the publication

copydeleteadd this publication to your clipboard
Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times.

, , , and . WSC, page 2205-2215. 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. You can also use the button next to the name to display some publications already assigned to the person.

Daniele Soroldoni

Daniele Silvestro

Daniele Palmisano

Daniele Suzzi

Daniele Pillitteri

 

Other publications of authors with the same name

Hybrid Metaheuristics for the Far From Most String Problem., , and . Hybrid Metaheuristics, volume 7919 of Lecture Notes in Computer Science, page 174-188. Springer, (2013)The constrained shortest path tour problem., , , and . Comput. Oper. Res., (2016)A generalized shortest path tour problem with time windows., , , and . Comput. Optim. Appl., 83 (2): 593-614 (2022)On the Shortest Path Problems with Edge Constraints., , , and . ICTON, page 1-4. IEEE, (2020)An efficient exact approach for the constrained shortest path tour problem., , and . Optim. Methods Softw., 35 (1): 1-20 (2020)Efficient GRASP solution approach for the Prisoner Transportation Problem., , , and . Comput. Oper. Res., (May 2023)The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm., , , and . Networks, 81 (2): 204-219 (March 2023)Reoptimizing shortest paths: From state of the art to new recent perspectives., , , and . ICTON, page 1-5. IEEE, (2016)Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands., , , , and . WSC, page 2989-3000. IEEE, (2018)A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem., , , and . J. Simulation, 16 (5): 480-493 (2022)