✦ LIBER ✦

On Two Commodity Network Flows

✍ Scribed by B. Rothschild and A. Whinston

Book ID: 123685152
Publisher: INFORMS
Year: 1966
Tongue: English
Weight: 422 KB
Volume: 14
Category: Article
ISSN: 0030-364X
DOI: 10.2307/168195

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Exact Algorithm for the Capacitated V

An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

✍ Baldacci, R.; Hadjiconstantinou, E.; Mingozzi, A. 📂 Article 📅 2004 🏛 INFORMS 🌐 English ⚖ 219 KB

Feasibility of Two Commodity Network Flo

Feasibility of Two Commodity Network Flows

✍ B. Rothschild and A. Whinston 📂 Article 📅 1966 🏛 INFORMS 🌐 English ⚖ 361 KB

Two commodity network flows and linear p

Two commodity network flows and linear programming

✍ M. Sakarovitch 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 692 KB

Two commodity flows

✍ S. Rajagopalan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Computing Two-Commodity Flows

✍ B. Rothschild, A. Whinston and J. Kent 📂 Article 📅 1968 🏛 INFORMS 🌐 English ⚖ 310 KB

A two-commodity sharing problem on netwo

A two-commodity sharing problem on networks

✍ Tetsuo Ichimori; Naoki Katoh 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 730 KB

## 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