๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An augmenting path method for solving Linear Bottleneck Transportation problems

โœ Scribed by U. Derigs; U. Zimmermann

Book ID
105511327
Publisher
Springer Vienna
Year
1979
Tongue
English
Weight
555 KB
Volume
22
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On three basic methods for solving bottl
On three basic methods for solving bottleneck transportation problems
โœ Ulrich Derigs ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 499 KB

For solving transportation problems essentially three types of methods are known: primal methods, the Hungarian method and the shortest augmenting path method. In this paper we present the specialization of these approaches to the bottleneck transportation problem and report some computational exper