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

DOI10.1287/OPRE.42.1.65MaRDI QIDQ4287600zbMATH OpenOpenAlexFDO

Authors Richard S. Barr, Betty L. Hickman

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

Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• The network simplex method on a multiprocessor
• Towards a practical parallelisation of the simplex method
• scientific article; zbMATH DE number 1057923
• Parallel algorithms for a multi-level network optimization problem
• Advances in the parallelization of the simplex method
• scientific article; zbMATH DE number 515934
• scientific article; zbMATH DE number 1086915
• An efficient implementation of the network simplex method

Cited in

(16)

• Generalized Networks: Parallel Algorithms and an Empirical Analysis
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming
• Parallel implementation of the TRANSIMS micro-simulation
• Parallel arc-allocation algorithms for optimizing generalized networks
• Solution of large dense transportation problems using a parallel primal algorithm
• Efficient parallel algorithms for the minimum cost flow problem
• Designing and reporting on computational experiments with heuristic methods
• Performance evaluation of independent superbasic sets on nonlinear replicated networks
• Towards a practical parallelisation of the simplex method
• A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates
• A Primal Simplex Approach to Pure Processing Networks
• A parallel implementation of the simplex function minimization routine
• Applying steepest-edge techniques to a network primal-dual algorithm
• The network simplex method on a multiprocessor
• An extreme‐point tabu‐search algorithm for fixed‐charge network problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287600)