Algorithm 360
From MaRDI portal
Cited in
(44)- Computing and listing \(st\)-paths in public transportation networks
- Computational efficiency of shortest path algorithms in C language
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
- An extension of labeling techniques for finding shortest path trees
- Solving some lexicographic multi-objective combinatorial problems
- An improved Dijkstra's shortest path algorithm for sparse network
- Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems
- Computing and listing \(st\)-paths in public transportation networks
- An analogue of Hoffman's circulation conditions for max-balanced flows
- Sharing information for the all pairs shortest path problem
- Optimal control with budget constraints and resets
- An efficient labeling technique for solving sparse assignment problems
- Microcomputer-based algorithms for large scale shortest path problems
- Weighted \(A^*\) search - unifying view and application
- A computational study of efficient shortest path algorithms
- A scaling algorithm for maximum weight matching in bipartite graphs
- Algebraic theory on shortest paths for all flows
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Heuristic shortest path algorithms for transportation applications: state of the art
- Algebraic theory on shortest paths for all flows
- Shortest paths algorithms: Theory and experimental evaluation
- Label-setting methods for multimode stochastic shortest path problems on graphs
- An evaluation of mathematical programming and minicomputers
- New scaling algorithms for the assignment and minimum mean cycle problems
- An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
- Flash memory efficient LTL model checking
- Scaling algorithms for network problems
- Shortest paths on dynamic graphs
- Shortest path reoptimization vs resolution from scratch: a computational comparison
- A fast algorithm for the path 2-packing problem
- Prioritized interdiction of nuclear smuggling via tabu search
- FXT
- hfloat
- libeikonal
- libolim
- heapsort
- Shortest path algorithms: A computational study with the C programming language
- The suffix tree of a tree and minimizing sequential transducers
- A new algorithm to find the shortest paths between all pairs of nodes
- An O(m log D) algorithm for shortest paths
- A parallel shortest path algorithm
- Hybrid Bellman-Ford-Dijkstra algorithm
- scientific article; zbMATH DE number 7121921 (Why is no real title available?)
- Ordered line integral methods for solving the eikonal equation
This page was built for software: Algorithm 360
