Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations

DOI10.1016/0377-2217(94)90060-4zbMath0813.90043OpenAlexW1963703107MaRDI QIDQ1342646

Stavros A. Zenios, Xiaoye Li

Publication date: 30 May 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90060-4

zbMATH Keywords

transportation problemsrelaxation algorithms\(\varepsilon\)-relaxation algorithmdata- parallel implementationhypercube communication networkmassively parallel connection machinemin-cost network flowtransshipment problems

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 (2)

Data parallel computing for network-structured optimization problems ⋮ Efficient parallel algorithms for the minimum cost flow problem

Uses Software

• NETGEN
• RELAX4

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the inversion temperature for water evaporation into an air - steam mixture
• Solution of large dense transportation problems using a parallel primal algorithm
• The auction algorithm: A distributed relaxation method for the assignment problem
• Proximal minimization algorithm with \(D\)-functions
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
• Network Optimization Problems: Algorithms, Applications and Complexity

This page was built for publication: Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations