Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming

DOI10.1287/IJOC.1.4.247MaRDI QIDQ4020661zbMATH OpenOpenAlexFDO

Authors A. T. Phillips, J. B. Rosen

Publication date 17 January 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1.4.247

zbMATH Keywords

multiple-cost-row linear program

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Efficient parallel linear programming
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
• On the application of parallel architectures to a class of operations research problems
• Anomalies in parallel branch-and-bound algorithms
• Parallel solution of large-scale, block-angular linear programs

Cited in

(5)

• A parallel algorithm for partially separable non-convex global minimization: Linear constraints
• Parallel algorithms for global optimization problems
• A note on superlinear speedup
• A parallel algorithm for constrained concave quadratic global minimization
• scientific article; zbMATH DE number 4164557 (Why is no real title available?)

This page was built for publication: Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming

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