Results 11 to 20 of about 32,185 (303)
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. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order $m+1$, where $m$ is the number of arcs in the ...
Hao Hu, Renata Sotirov
openaire +6 more sources
Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks [PDF]
This article is posted here with permission from the IEEE - Copyright @ 2009 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic ...
Yang, S +5 more
core +3 more sources
TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
A lower bound for the shortest path problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MULMULEY, K, SHAH, P
openaire +2 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
openaire +3 more sources
Study on single-valued neutrosophic graph with application in shortest path problem
Fuzzy set and neutrosophic set are two efficient tools to handle the uncertainties and vagueness of any real-world problems. Neutrosophic set is more useful than fuzzy set (intuitionistic fuzzy sets) to manage the uncertainties of a real-life problem ...
Ruxiang Liu
doaj +1 more source
An Analysis of Stochastic Shortest Path Problems [PDF]
We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes can be positive as well as negative.
Dimitri P. Bertsekas, John N. Tsitsiklis
openaire +1 more source
ANT COLONY OPTIMIZATION PARAMETER SELECTION FOR SHORTEST PATH PROBLEM [PDF]
The shortest path problem has been studied to be solved through diverse deterministic and also stochastic approaches such as Ant Colony Optimization. One of the most challenging issues with the implication of Ant Colony Optimization to solve the shortest
N. Zarrinpanjeh +5 more
doaj +1 more source
The Resource constrained shortest path problem implemented in a lazy functional language [PDF]
The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language.
Hartel, Pieter H. +3 more
core +1 more source
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 +1 more source

