𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A two-commodity sharing problem on networks

✍ Scribed by Tetsuo Ichimori; Naoki Katoh

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
730 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

This paper considers a sharing problem of distributing a given quantity of resources to a set of demand nodes in a network as equally as possible. We study the case in which the resources are of two distinct kinds and propose a polynomial time algorithm for it by reducing the problem to the one‐commodity sharing problem.

πŸ“œ SIMILAR VOLUMES

Restricted delivery problems on a networ
Restricted delivery problems on a network
✍ Arkin, Esther M.; Hassin, Refael; Klein, Limor πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 125 KB

We consider a delivery problem on a network in which nodes have supplies or demands for certain products and arcs have lengths satisfying the triangle inequality. A vehicle of infinite capacity travels through the network, carrying products to their destinations, and is limited in that it can carry

A problem on blocking probabilities in c
A problem on blocking probabilities in connecting networks
✍ F. R. K. Chung; F. K. Hwang πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

## Abstract We begin with a three‐stage linear graph in which the first stage has a single node u and the third stage a single node v. The second stage has k independent nodes, each of which is connected by one link to u and to v. In general, we can form a (2n+1)‐stage linear graph recursively by l