scientific article; zbMATH DE number 4197775

DOI10.1002/1520-6750(199102)38:1%3C71::AID-NAV3220380108%3E3.0.CO;2-6MaRDI QIDQ5202858zbMATH OpenFDO

Authors John Mote, Munirpallam A. Venkataramanan, John J. Dinkel

Publication date 1991

zbMATH Keywords

vectorization of the primal simplex based network algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Recommendations

• Vectorization and multitasking of nonlinear network programming algorithms
• An efficient method for nonlinearly constrained networks
• scientific article; zbMATH DE number 2084706
• Vector network equilibrium problems and nonlinear scalarization methods
• Network optimization and problems with coupling variables
• scientific article; zbMATH DE number 60242
• Vector network equilibrium problems with capacity constraints of arcs and nonlinear scalarization methods
• scientific article; zbMATH DE number 1340882
• scientific article; zbMATH DE number 1947414
• A specialized network simplex algorithm for the constrained maximum flow problem

Cites work

• scientific article; zbMATH DE number 3324320 (Why is no real title available?)
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Pivot Strategies for Primal-Simplex Network Codes

Cited in

(4)

• Performance evaluation of vector implementations of combinatorial algorithms
• Vector processing in simplex and interior methods for linear programming
• A method of vector processing for shared symbolic data
• Vectorization and multitasking of nonlinear network programming algorithms

This page was built for publication:

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