A new strongly polynomial dual network simplex algorithm

Authors:
Ronald D. Armstrong;Zhiying Jin
Affiliations:
-;-
Venue:
Mathematical Programming: Series A and B
Year:
1997

Citing 0
Cited 3

On dual minimum cost flow algorithms (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Parallel algorithm for the routing problem: an implementation in the parallel computer IBM-SP2

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract