Parallel primal-dual methods for the minimum cost flow problem

DOI10.1007/BF01299544zbMath0810.90032OpenAlexW2013479277MaRDI QIDQ1315451

Dimitri P. Bertsekas, David A. Castanon

Publication date: 1993

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01299544

zbMATH Keywords

primal-dual methodparallel implementationasynchronous implementationpath-augmentation algorithmminimum-cost capacitated flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)

Related Items (1)

Efficient parallel algorithms for the minimum cost flow problem

Uses Software

• NETGEN
• RELAX4

Cites Work

• Parallel synchronous and asynchronous implementations of the auction algorithm
• A unified framework for primal-dual methods in minimum cost network flow problems
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A parallel shortest augmenting path algorithm for the assignment problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel primal-dual methods for the minimum cost flow problem