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

A note on Arc tolerances in sparse shortest-path and network flow problems

โœ Scribed by Dan Gusfield

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
298 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Note on independence of arcs in antipara
Note on independence of arcs in antiparallel for network flow problems
โœ Jane Nichols Hagstrom ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 206 KB ๐Ÿ‘ 1 views

## Abstract Given a transportation flow network with two arcs in antiparallel, if the capacities of all other arcs are fixed and the demands at sinks are fixed, at least one of the two arcs will be irrelevant to the problem of flow feasibility. As a consequence, in a stochastic setting, two arcs in