๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Arc tolerances in shortest path and network flow problems

โœ Scribed by D. R. Shier; Christoph Witzgall

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
752 KB
Volume
10
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Shortest paths in stochastic networks wi
Shortest paths in stochastic networks with ARC lengths having discrete distributions
โœ Gehan A. Corea; Vidyadhar G. Kulkarni ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 688 KB

## Abstract In this work, we compute the distribution of __L__\*, the length of a shortest __(s, t)__ path, in a directed network __G__ with a source node __s__ and a sink node __t__ and whose arc lengths are independent, nonnegative, integer valued random variables having finite support. We constr

Shortest path routing and fault-tolerant
Shortest path routing and fault-tolerant routing on de Bruijn networks
โœ Mao, Jyh-Wen; Yang, Chang-Biau ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 170 KB ๐Ÿ‘ 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina

Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
โœ Ishwar Murthy; Shenq-Shyong Her ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri