Results 1 to 10 of about 302,682 (305)
A lower bound for the shortest path problem [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. Mulmuley, P. Shah
openalex +4 more sources
On Solving the Quadratic Shortest Path Problem [PDF]
INFORMS Journal on Computing, 2017 The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized.
Hao Hu, R. Sotirov
semanticscholar +6 more sources
On the Quadratic Shortest Path Problem [PDF]
The Sea, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Borzou Rostami +3 more
semanticscholar +5 more sources
A bio-inspired method for the constrained shortest path problem. [PDF]
ScientificWorldJournal, 2014 The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Wang H +5 more
europepmc +2 more sources
An improved Physarum polycephalum algorithm for the shortest path problem. [PDF]
ScientificWorldJournal, 2014 Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Zhang X +6 more
europepmc +2 more sources
Shortest Path Problems on a Polyhedral Surface [PDF]
Algorithmica, 2009 We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface are measured either by the length of a Euclidean shortest path or by link distance. Our main result is a linear-factor speedup for computing all shortest path edge sequences on
Atlas F. Cook, Carola Wenk
openalex +7 more sources
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003.
Johan Wästlund
openalex +5 more sources
Variations on the Stochastic Shortest Path Problem [PDF]
International Conference on Verification, Model Checking and Abstract Interpretation, 2014 In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the distribution of ...
Mickael Randour +2 more
semanticscholar +5 more sources
Analysis of Dijkstra’s Algorithm and A* Algorithm in Shortest Path Problem
Journal of Physics: Conference Series, 2020 Finding the shortest path in direction effective is essential. To solve this shortest path problem, we usually using Dijkstra or A* algorithm. These two algorithms are often used in routing or road networks. This paper’s objective is to compare those two
D. Rachmawati, Lysander Gustin
semanticscholar +1 more source
Solving the Network Shortest Path Problem on a Quantum Annealer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
semanticscholar +1 more source