A reduction heuristic for the all-colors shortest path problem
RAIRO-Oper. Res., 55 (2021) S2071-S2082
Published online: 2021-03-02
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Chatgpt and operations research: evaluation on the shortest path problem
Martina Luzzi, Francesca Guerriero, Marco Maratea, Gianluigi Greco and Marco GarofaloSoft Computing 29 (3) 1407 (2025)
https://doi.org/10.1007/s00500-025-10505-2
Shortest paths with exclusive-disjunction arc pairs conflicts
Raffaele Cerulli, Francesca Guerriero, Edoardo Scalzo and Carmine SorgenteComputers & Operations Research 152 106158 (2023)
https://doi.org/10.1016/j.cor.2023.106158
Spanning simple path inside a simple polygon
Abdolah Sepahvand and Mohammadreza RazzaziThe Journal of Supercomputing 79 (3) 2740 (2023)
https://doi.org/10.1007/s11227-022-04765-0
Biological survival optimization algorithm with its engineering and neural network applications
Likai Wang, Qingyang Zhang, Xiangyu He, et al.Soft Computing 27 (10) 6437 (2023)
https://doi.org/10.1007/s00500-023-07851-4
The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
Francesco Carrabs, Ciriaco D'Ambrosio, Daniele Ferone, Paola Festa and Federica LaureanaNetworks 78 (1) 17 (2021)
https://doi.org/10.1002/net.22010