Results 1 to 10 of about 550,853 (271)
A Bio-Inspired Method for the Constrained Shortest Path Problem [PDF]
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.
Hongping Wang+4 more
doaj +3 more sources
Neutrosophic Shortest Path Problem [PDF]
Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to ...
Ranjan Kumar+4 more
doaj +3 more sources
Solving the Network Shortest Path Problem on a Quantum Annealer
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
doaj +2 more sources
On Solving the Quadratic Shortest Path Problem [PDF]
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
A lower bound for the shortest path problem [PDF]
AbstractWe show that the shortest path problem cannot be solved in o(logn) time on an unbounded fan-in PRAM without bit operations using poly(n) processors, even when the bit-lengths of the weights on the edges are restricted to be of size O(log3n). This shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in
K. Mulmuley, P. Shah
openalex +4 more sources
On the Quadratic Shortest Path Problem [PDF]
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
An improved Physarum polycephalum algorithm for the shortest path problem. [PDF]
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]
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]
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]
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 +6 more sources