Results 301 to 310 of about 280,639 (334)
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
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
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
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
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
Shortest and longest path problems
Optimization, 1996This paper considers a wide class of shortest path problems in acyclic digraphs, where path lengths are given by the multiplicatively additive value. The problems are solved through bynamic programming, [4]. The bynamic programming formulation for the class has a system of two interrelated recursive equations. By solving the system, simultaneously both
openaire +2 more sources