The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems

DOI10.1023/A:1008667714641zbMath1040.90552OpenAlexW2946365347MaRDI QIDQ1294809

Renato De Leone, Robert R. Meyer

Publication date: 1999

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

Full work available at URL: https://doi.org/10.1023/a:1008667714641

zbMATH Keywords

network flowsasynchronousrelaxation methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)

Related Items (2)

A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ Implementation and test of auction methods for solving generalized network flow problems with separable convex cost

This page was built for publication: The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems