|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 10 of 10 found articles
| Title: |
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem |
| Author: |
Goldfarb, Donald Hao, Jianxiu |
| Appeared in: |
Operations research letters |
| Paging: | Volume 10 (1991) nr. 7 pages 5 p. |
| Year: |
1991 |
| Contents: | |
| Publisher: |
Published by Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 10 of 10 found articles
| << previous |