✦ LIBER ✦

Two new algorithms for minimal cost flow problems

✍ Scribed by W. Domschke

Publisher: Springer Vienna
Year: 1973
Tongue: English
Weight: 495 KB
Volume: 11
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02252916

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-phase Heuristic Algorithm for Delay

Two-phase Heuristic Algorithm for Delay Constrained Minimal Cost Loop Problem

✍ Yong-Jin Lee; Tai-Yun Kim 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 589 KB

This article presents a heuristic algorithm that consists of two phases for the DMCLP under the constraints that the number of nodes served by a single loop is limited and networks mean delay is within the desired time.

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

Nonlinear one-parametric minimal cost ne

Nonlinear one-parametric minimal cost network flow problems

✍ H. P. Pasch 📂 Article 📅 1982 🏛 Springer 🌐 German ⚖ 398 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

Parallel algorithms for the assignment a

Parallel algorithms for the assignment and minimum-cost flow problems

✍ James B. Orlin; Clifford Stein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB