The following pages link to Algorithm 360 (Q41533):
Displaying 39 items.
- Sharing information for the all pairs shortest path problem (Q391758) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- An improved Dijkstra's shortest path algorithm for sparse network (Q870157) (← links)
- Prioritized interdiction of nuclear smuggling via tabu search (Q895756) (← links)
- An extension of labeling techniques for finding shortest path trees (Q1027584) (← links)
- An efficient labeling technique for solving sparse assignment problems (Q1071650) (← links)
- Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- A parallel shortest path algorithm (Q1112621) (← links)
- A computational study of efficient shortest path algorithms (Q1112733) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- An O(m log D) algorithm for shortest paths (Q1145158) (← links)
- A new algorithm to find the shortest paths between all pairs of nodes (Q1157967) (← links)
- Shortest path algorithms: A computational study with the C programming language (Q1184466) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems (Q1219826) (← links)
- An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
- An analogue of Hoffman's circulation conditions for max-balanced flows (Q1802959) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- A fast algorithm for the path 2-packing problem (Q2268342) (← links)
- An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations (Q2276405) (← links)
- Ordered line integral methods for solving the eikonal equation (Q2291900) (← links)
- Algebraic theory on shortest paths for all flows (Q2424883) (← links)
- Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162) (← links)
- Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs (Q3168996) (← links)
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133) (← links)
- (Q3517725) (← links)
- Shortest paths on dynamic graphs (Q3638853) (← links)
- Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
- (Q5240196) (← links)
- Optimal Control with Budget Constraints and Resets (Q5252497) (← links)
- Computing and Listing st-Paths in Public Transportation Networks (Q5740180) (← links)
- (Q5743486) (← links)
- Algebraic Theory on Shortest Paths for All Flows (Q5743545) (← links)
