ALGORITHMS FOR THE MINIMAX TRANSPORTATION PROBLEM

[1] MINIMAX LINEAR-PROGRAMMING PROBLEM [J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (03) : 131 - 134

[2] AHUJA RK, 1982, THESIS INDIAN I TECH

[3] AN ALGORITHM FOR SOLVING LINEARLY CONSTRAINED MINIMAX PROBLEMS [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (02) : 158 - 166

[4] SUBGRADIENT ALGORITHM FOR CERTAIN MINIMAX AND MINISUM PROBLEMS [J]. MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 130 - 145

[5] DATTA SRK, 1977, MATH PROGRAM, V13, P140

[6] AUGMENTING PATH METHOD FOR SOLVING LINEAR BOTTLENECK TRANSPORTATION PROBLEMS [J]. COMPUTING, 1979, 22 (01) : 1 - 15

[7] DERIGS U, 1982, OR SPEKTRUM, V4, P213

[8] Ford L., 1962, FLOWS NETWORKS

[9] BOTTLENECK TRANSPORTATION PROBLEM [J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04): : 465 - +

[10] HAMMER PL, 1969, NAV RES LOGIST Q, V16, P345

[1] MINIMAX LINEAR-PROGRAMMING PROBLEM [J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (03) : 131 - 134

[2] AHUJA RK, 1982, THESIS INDIAN I TECH

[3] AN ALGORITHM FOR SOLVING LINEARLY CONSTRAINED MINIMAX PROBLEMS [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (02) : 158 - 166

[4] SUBGRADIENT ALGORITHM FOR CERTAIN MINIMAX AND MINISUM PROBLEMS [J]. MATHEMATICAL PROGRAMMING, 1978, 15 (02) : 130 - 145

[5] DATTA SRK, 1977, MATH PROGRAM, V13, P140

[6] AUGMENTING PATH METHOD FOR SOLVING LINEAR BOTTLENECK TRANSPORTATION PROBLEMS [J]. COMPUTING, 1979, 22 (01) : 1 - 15

[7] DERIGS U, 1982, OR SPEKTRUM, V4, P213

[8] Ford L., 1962, FLOWS NETWORKS

[9] BOTTLENECK TRANSPORTATION PROBLEM [J]. NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04): : 465 - +

[10] HAMMER PL, 1969, NAV RES LOGIST Q, V16, P345