Answers are grounded in this paper and cite their sources.
We describe a procedure for finding a starting dual feasible solution or terminating by showing that such a solution does not exist, i.e., by detecting a negative cycle. This dual solution can then be used to convert the distance matrix into a nonnegative distance matrix where Dijkstra’s algorithm can be used.
No takes yet. Share an insight, caveat, or question.
Bazaraa et al. (1974) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: