Publication | Closed Access

The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm

Mathematical ProgrammingRoute ChoiceNetwork Routing AlgorithmEmpirical AnalysisEngineeringNetwork AlgorithmRoute PlanningOne-to-one Shortest-path ProblemNetwork AnalysisLogisticsComputational ComplexityTwo-tree Dijkstra AlgorithmComputer ScienceVehicle Routing ProblemCombinatorial OptimizationOperations Research