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

Algorithms for the minimax transportation problem

โœ Scribed by R. K. Ahuja


Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
728 KB
Volume
33
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An algorithm for minimax parameter optim
โœ J.E. Heller; J.B. Cruz Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 905 KB

Sunnnary--The minimization, with respect to a set of parameters, of the maximum, with respect to another set of parameters, of a scalar performance index is considered. An algorithm for generating a sequence with a limit point which satisfies a necessary condition for a minimax solution is presented

Some minimax problems for graphs
โœ Miroslav Fiedler ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 462 KB

Fiedler, M., Some minimax problems for graphs, Discrete Mathematics 121 (1993) 65-74. If a characteristic of a simple graph G allows an extension to nonnegative edge valuations of G, the corresponding absolute characteristic is defined as the extreme of the characteristic over all nonnegative edge

The bottleneck transportation problem
โœ R. S. Garfinkel; M. R. Rao ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 326 KB