Dual coordinate step methods for linear network flow problems

Authors:
D. P. Bertsekas;J. Eckstein
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Mathematical Programming: Series A and B
Year:
1988

Citing 0
Cited 6

Decomposition Methods for Differentiable Optimization Problems overCartesian Product Sets

Computational Optimization and Applications
A Parallel Pruning Technique for Highly Asymmetric Assignment Problems

IEEE Transactions on Parallel and Distributed Systems
Implementation and test of auction methods for solving generalized network flow problems with separable convex cost

Journal of Optimization Theory and Applications
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems

INFORMS Journal on Computing
Fast chromosome karyotyping by auction algorithm

International Journal of Bioinformatics Research and Applications
Parallel synchronous and asynchronous implementations of the auction algorithm

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract