✦ LIBER ✦

Nonlinear one-parametric minimal cost network flow problems

✍ Scribed by H. P. Pasch

Publisher: Springer
Year: 1982
Tongue: German
Weight: 398 KB
Volume: 4
Category: Article
ISSN: 0171-6468
DOI: 10.1007/bf01720215

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parametric algorithm for convex cost n

A parametric algorithm for convex cost network flow and related problems

✍ R.K. Ahuja; J.L. Batra; S.K. Gupta 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Infinite networks: Minimal cost flows

✍ B. Fuchssteiner; K. Morisse 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 323 KB

We are concerned with the minimal cost flow problem in infinite networks. The generalisation to infinite networks is made in order to provide tools for the study of the dynamics of such networks. By disintegration methods, we obtain that the minimal transportation costs are the supremum of the diffe

The minimal cost flow problem with conve

The minimal cost flow problem with convex costs

✍ V. V. Menon 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

The minimal average cost flow problem

✍ Y.L. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 600 KB

Two new algorithms for minimal cost flow

Two new algorithms for minimal cost flow problems

✍ W. Domschke 📂 Article 📅 1973 🏛 Springer Vienna 🌐 English ⚖ 495 KB

Minimal-cost flow in certain linear-prog

Minimal-cost flow in certain linear-programming problems

✍ I. Kh. Sigal; Yu. Yu. Finkel'shtein 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 111 KB