Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup

DOI10.1287/opre.42.1.65zbMath0798.90040OpenAlexW2091043074MaRDI QIDQ4287600

Betty L. Hickman, Richard S. Barr

Publication date: 12 April 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dced933fad0e5802c61717ed5359020c8d4cf5b1

zbMATH Keywords

parallel implementationminimum cost network flowprimal simplex methodrandomly generated transportation and transshipment problems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) 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 (7)

Applying steepest-edge techniques to a network primal-dual algorithm ⋮ Efficient parallel algorithms for the minimum cost flow problem ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ An extreme‐point tabu‐search algorithm for fixed‐charge network problems ⋮ A parallel implementation of the simplex function minimization routine ⋮ Towards a practical parallelisation of the simplex method ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

This page was built for publication: Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup