( en | de | ru )

 

Disambiguation of "Ferone, Daniele"

Author of the publication

copydeleteadd this publication to your clipboard
A New Local Search for the p-Center Problem Based on the Critical Vertex Concept.

, , , and . LION, volume 10556 of Lecture Notes in Computer Science, page 79-92. Springer, (2017)

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 Capriotti

Daniele Gaggero

 

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)On the Shortest Path Problems with Edge Constraints., , , and . ICTON, page 1-4. IEEE, (2020)A generalized shortest path tour problem with time windows., , , and . Comput. Optim. Appl., 83 (2): 593-614 (2022)A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem., , , , and . Int. Trans. Oper. Res., 27 (3): 1368-1391 (2020)A simheuristic Algorithm for solving an Integrated Resource Allocation and Scheduling Problem., , , , and . WSC, page 3340-3351. 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)On the fast solution of the p-center problem., , , and . ICTON, page 1-4. IEEE, (2017)A dynamic programming algorithm for solving the k-Color Shortest Path Problem., , , and . Optim. Lett., 15 (6): 1973-1992 (2021)The Shortest Path Tour Problem and its variants.. University of Naples Federico II, Italy, (2017)base-search.net (ftunivnapoli:oai:fedoa.unina.it:11644).