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

Method of solving the network transport problem

โœ Scribed by V.A. Gorelik; M.S. Shtilman

Publisher
Elsevier Science
Year
1964
Weight
458 KB
Volume
4
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving the optimal network problem
Solving the optimal network problem
โœ T.B. Boffey; A.I. Hinxman ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 761 KB
Network dual steepest-edge methods for s
Network dual steepest-edge methods for solving capacitated multicommodity network problems
โœ Chiun-Ming Liu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

This paper presents a two-phased network dual steepest-edge method for solving capacitated multicommodity network problems. In the first phase, an advanced starting solution in concert with a dual steepest-edge method is applied to solve each capacitated single-commodity network problem. At each ite

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