Algorithm 360

swMATH29819MaRDI QIDQ41533FDOQ41533

Author name not available (Why is that?)

Cited In (39)

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

This page was built for software: Algorithm 360