Shortest-path feasibility algorithms
From MaRDI portal
Publication:5406208
DOI10.1145/1498698.1537602zbMath1284.05275OpenAlexW2049745956MaRDI QIDQ5406208
Loukas Georgiadis, Renato F. Werneck, Andrew V. Goldberg, Boris V. Cherkassky, Robert Endre Tarjan
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1498698.1537602
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items
The dial-A-ride problem with transfers, Parcel delivery cost minimization with time window constraints using trucks and drones, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Energy-optimal routes for battery electric vehicles, Vehicle routing with transportable resources: using carpooling and walking for on-site services
