Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
DOI10.1287/OPRE.42.1.65zbMATH Open0798.90040OpenAlexW2091043074MaRDI QIDQ4287600FDOQ4287600
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
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
parallel implementationminimum cost network flowprimal simplex methodrandomly generated transportation and transshipment problems
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)
Cited In (16)
- Applying steepest-edge techniques to a network primal-dual algorithm
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
- Generalized Networks: Parallel Algorithms and an Empirical Analysis
- Parallel implementation of the TRANSIMS micro-simulation
- A Primal Simplex Approach to Pure Processing Networks
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- A parallel implementation of the simplex function minimization routine
- The network simplex method on a multiprocessor
- Towards a practical parallelisation of the simplex method
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Parallel arc-allocation algorithms for optimizing generalized networks
- Solution of large dense transportation problems using a parallel primal algorithm
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming
- A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates
- Designing and reporting on computational experiments with heuristic methods
- Efficient parallel algorithms for the minimum cost flow problem
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)
