On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Donald Goldfarb, Jianxiu HaoVolume:
10
Year:
1991
Language:
english
Pages:
5
DOI:
10.1016/0167-6377(91)90039-r
File:
PDF, 324 KB
english, 1991