Results 321 to 330 of about 779,089 (370)
Some of the next articles are maybe not open access.
1970
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
openaire +2 more sources
The first image that comes to mind when the word ‘network’ is mentioned is a traffic network, whether it be road or air traffic. Most of us are familiar with such networks since one rarely travels from one location to another without consulting a ‘map’, which is, in our terminology, a ‘network’.
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
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
Shortest path tour problem with time windows
European Journal of Operational Research, 2020This paper aims at studying a new variant of the shortest path tour problem, where time window constraints are taken into account. This is the first work dealing with the shortest path tour problem with time windows. The problem is formally described and its theoretical properties are analyzed.
Luigi Di Puglia Pugliese +3 more
openaire +8 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
Networks, 2004
In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution
Dominique Feillet +3 more
semanticscholar +1 more source
In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution
Dominique Feillet +3 more
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
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