Results 221 to 230 of about 550,853 (271)
Some of the next articles are maybe not open access.
An Inverse Shortest Path Problem on an Uncertain Graph
J. Networks, 2014The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights.
Jian Zhou, F. Yang, Ke Wang
semanticscholar +1 more source
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
, 2014
We present a general treatment of shortest path problems by dynamic program in networks having normal probability distributions as arc lengths. We consider a network that may contains cycles. Two operators of sum and comparison need to be adapted for the
Mohammad Hessam Olya
semanticscholar +1 more source
We present a general treatment of shortest path problems by dynamic program in networks having normal probability distributions as arc lengths. We consider a network that may contains cycles. Two operators of sum and comparison need to be adapted for the
Mohammad Hessam Olya
semanticscholar +1 more source
On a multicriteria shortest path problem
European Journal of Operational Research, 1984Abstract Multicriteria shortest path problems have not been treated intensively in the specialized literature, despite their potential applications. In fact, a single objective function may not be sufficient to characterize a practical problem completely.
openaire +2 more sources
Shortest path problem with forbidden paths: The elementary version
European Journal of Operational Research, 2013This paper addresses the elementary shortest path problem with forbidden paths. The main aim is to find the shortest paths from a single origin node to every other node of a directed graph, such that the solution does not contain any path belonging to a given set (i.e.; the forbidden set).
Di Puglia Pugliese L, Guerriero F
openaire +3 more sources
A new GPU-based approach to the Shortest Path problem
International Symposium on High Performance Computing Systems and Applications, 2013The Single-Source Shortest Path (SSSP) problem arises in many different fields. In this paper we present a GPU-based version of the Crauser et al. SSSP algorithm.
Hector Ortega-Arranz +3 more
semanticscholar +1 more source
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
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
The Fixed-Charge Shortest-Path Problem
INFORMS Journal on Computing, 2012Consider a network 𝒩 =(N, A) and associate with each arc e ∈ A a fixed cost ce for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost [Formula: see text] for resource consumed along e.
Engineer, Faramroze G. +3 more
openaire +2 more sources
The k-Color Shortest Path Problem
2019This paper proposes a mathematical model and an exact algorithm for a novel problem, the k-Color Shortest Path Problem. This problem is defined on a edge-colored weighted graph, and its aim is to find a shortest path that uses at most k different edge-colors.
Ferone D., Festa P., Pastore T.
openaire +3 more sources