Results 251 to 260 of about 302,682 (305)
Some of the next articles are maybe not open access.
Shortest Paths with Shortest Detours
Journal of Optimization Theory and Applications, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carolin Torchiani +3 more
openaire +2 more sources
On the Forward Shortest Path Tour Problem
2017This paper addresses the Forward Shortest Path Tour Problem (FSPTP). Given a weighted directed graph, whose nodes are partitioned into clusters, the FSPTP consists of finding a shortest path from a source node to a destination node and which crosses all the clusters in a fixed order.
Carrabs, Francesco +3 more
openaire +4 more sources
Computation of the Reverse Shortest-Path Problem
Journal of Global Optimization, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yixun Lin, J. Z. Zhang
openaire +2 more sources
2007
In this chapter we consider the shortest route problem where distances/costs are not known precisely and are modeled using fuzzy numbers. The fuzzy shortest route problem is outlined in the next section. We have previously used an evolutionary algorithm to solve an example problem (Section 6.5.1 of [2] and [3]).
James J. Buckley, Leonard J. Jowers
openaire +2 more sources
In this chapter we consider the shortest route problem where distances/costs are not known precisely and are modeled using fuzzy numbers. The fuzzy shortest route problem is outlined in the next section. We have previously used an evolutionary algorithm to solve an example problem (Section 6.5.1 of [2] and [3]).
James J. Buckley, Leonard J. Jowers
openaire +2 more sources
Computers & Industrial Engineering, 1994
Abstract We discuss the problem of finding the shortest paths from a fixed origin to a specified nodes in a network with arcs represented as intervals on real line. As a preliminary, we define the order relation between intervals by using two parameters.
Mitsuo Gen, Shinkoh Okada
openaire +2 more sources
Abstract We discuss the problem of finding the shortest paths from a fixed origin to a specified nodes in a network with arcs represented as intervals on real line. As a preliminary, we define the order relation between intervals by using two parameters.
Mitsuo Gen, Shinkoh Okada
openaire +2 more sources
Shortest Path Problems in Hydrogeology
Groundwater, 1978ABSTRACTMany aspects of ground water involve shortest paths between two points and shortest round trips to many points. These problems are included in network theory which is not easily available to ground‐water specialists. This paper introduces some of the techniques which can be solved by hand for fairly small projects.
openaire +2 more sources
Resolving the shortest path problem using the haversine algorithm
, 2020D. A. Prasetya +4 more
semanticscholar +1 more source
A multi-objective shortest path problem
Mathematical Methods of Operations Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A note on the problem of updating shortest paths
Networks, 1981AbstractThe problem of updating shortest paths from all the vertices to a set of vertices when the length function is decreased was considered by S. Goto and A. Sangiovanni‐Vincentelli and a solution algorithm was presented based on the LU‐factorization of the measure matrix and a matrix inversion formula.
openaire +2 more sources
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing, 1995Summary: We describe a new method for designing scaling algorithms for the single- source shortest paths problem and use this method to obtain an \(O (\sqrt nm \log N)\) algorithm for the problem. (Here \(n\) and \(m\) are the number of nodes and arcs in the input network and \(N\) is essentially the absolute value of the most negative arc length: arc ...
openaire +2 more sources