The network simplex method on a multiprocessor

DOI10.1002/net.3230200704zbMath0712.90024OpenAlexW1977776590MaRDI QIDQ3197596

Jörg Peters

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200704

zbMATH Keywords

minimal cost network flownetwork simplex methodshared memory multiprocessorparallel pricing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items (2)

Efficient parallel algorithms for the minimum cost flow problem ⋮ Towards a practical parallelisation of the simplex method

Cites Work

• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: The network simplex method on a multiprocessor