Algorithm 360
From MaRDI portal
Software:41533
No author found.
Related Items (39)
Scaling algorithms for network problems ⋮ Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Computing and listing \(st\)-paths in public transportation networks ⋮ A parallel shortest path algorithm ⋮ A computational study of efficient shortest path algorithms ⋮ An improved Dijkstra's shortest path algorithm for sparse network ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ The suffix tree of a tree and minimizing sequential transducers ⋮ Unnamed Item ⋮ Sharing information for the all pairs shortest path problem ⋮ Flash memory efficient LTL model checking ⋮ Prioritized interdiction of nuclear smuggling via tabu search ⋮ Algebraic theory on shortest paths for all flows ⋮ An O(m log D) algorithm for shortest paths ⋮ A new algorithm to find the shortest paths between all pairs of nodes ⋮ Shortest path algorithms: A computational study with the C programming language ⋮ New scaling algorithms for the assignment and minimum mean cycle problems ⋮ Hybrid Bellman-Ford-Dijkstra algorithm ⋮ Computing and Listing st-Paths in Public Transportation Networks ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems ⋮ A fast algorithm for the path 2-packing problem ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations ⋮ An evaluation of mathematical programming and minicomputers ⋮ Ordered line integral methods for solving the eikonal equation ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm ⋮ Shortest paths on dynamic graphs ⋮ An extension of labeling techniques for finding shortest path trees ⋮ Optimal Control with Budget Constraints and Resets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving some lexicographic multi-objective combinatorial problems ⋮ Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm ⋮ An efficient labeling technique for solving sparse assignment problems ⋮ Microcomputer-based algorithms for large scale shortest path problems
This page was built for software: Algorithm 360
