✦ LIBER ✦

An augmenting path method for solving Linear Bottleneck Assignment problems

✍ Scribed by U. Derigs; U. Zimmermann

Book ID: 105514066
Publisher: Springer Vienna
Year: 1978
Tongue: English
Weight: 459 KB
Volume: 19
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02252026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An augmenting path method for solving Li

An augmenting path method for solving Linear Bottleneck Transportation problems

✍ U. Derigs; U. Zimmermann 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 555 KB

A shortest augmenting path method for so

A shortest augmenting path method for solving minimal perfect matching problems

✍ Ulrich Derigs 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a

A shortest augmenting path algorithm for

A shortest augmenting path algorithm for dense and sparse linear assignment problems

✍ R. Jonker; A. Volgenant 📂 Article 📅 1987 🏛 Springer Vienna 🌐 English ⚖ 802 KB

An efficient method for solving linear g

An efficient method for solving linear goal programming problems

✍ H. L. Li 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 155 KB

Convergence of an iterative method for s

Convergence of an iterative method for solving linear programming problems

✍ R.P. Fedorenko 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 914 KB

An iterational method for solving non-li

An iterational method for solving non-linear boundary value problems

✍ V.A. Vinokurov; N.F. Repnikov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 667 KB