Improved dual network simplex

Authors:
Serge A. Plotkin;Éva Tardos
Affiliations:
Department of Computer Science, Stanford University, Stanford, CA;School of Operations Research, Cornell University, Ithaca, NY
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 1
Cited 3

A faster strongly polynomial minimum cost flow algorithm

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

A polynomial time primal network simplex algorithm for minimum cost flows

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Clustering for faster network simplex pivots

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On dual minimum cost flow algorithms (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract