AUGMENTING PATH METHOD FOR SOLVING LINEAR BOTTLENECK TRANSPORTATION PROBLEMS

被引：10

作者：

DERIGS, U

ZIMMERMANN, U

机构：

[1] Mathematisches Institut, Universität zu Köln, Köln 41, D-5000

来源：

COMPUTING | 1979年 / 22卷 / 01期

关键词：

D O I：

10.1007/BF02246556

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An efficient method for solving Linear Bottleneck Transportation problems is described. The method starts with a heuristically determined lower bound for the optimal value. Shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed. A FORTRAN IV subroutine can be found in the appendix. © 1979 Springer-Verlag.

引用

页码：1 / 15

页数：15

共 17 条

[1] GENERAL HUNGARIAN METHOD FOR ALGEBRAIC TRANSPORTATION PROBLEM
BURKARD, RE
[J]. DISCRETE MATHEMATICS, 1978, 22 (03) : 219 - 232
[2] BURKARD RE, 1978, EC MATH SYSTEMS, V157, P55
[3] BURKARD RE, 1977, 773 U KOLN MATH I RE
[4] AUGMENTING PATH METHOD FOR SOLVING LINEAR BOTTLENECK ASSIGNMENT PROBLEMS
DERIGS, U
ZIMMERMANN, U
[J]. COMPUTING, 1978, 19 (04) : 285 - 295
[5] Dijkstra E., 1959, NUMER MATH, V1, P269
[6] Edmonds J., 1970, J COMB THEORY, V8, P299, DOI DOI 10.1016/S0021-9800(70)80083-7
[7] ESSER R, 1977, SORTIEREN SUCHEN VOR
[8] BOTTLENECK TRANSPORTATION PROBLEM
GARFINKEL, RS
RAO, MR
[J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04): : 465 - +
[9] GLOVER F, 1972, TRANSPORT SCI, V6, P171
[10] GREENWOOD JA, 1976, 1976 P COMP STAT WIE

← 1 2 →