Shortest-path feasibility algorithms

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

zbMATH Keywords

feasibilitynegative cyclesShortest paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

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

This page was built for publication: Shortest-path feasibility algorithms