A computational comparison of the network simplex method with the dual affine scaling method

MaRDI QIDQ806669zbMATH OpenFDO

Authors Sanjay Mehrotra, Andrew P. Armacost

Publication date 1991

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

transportationassignmentdual affine scaling methodminimum cost network flownetwork simplex methodcomplete Cholesky factors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 515933
• An efficient implementation of the network simplex method
• scientific article; zbMATH DE number 4174642
• The Scaling Network Simplex Algorithm
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks

Cited in

(3)

• An affine scaling method for solving network flow problems
• scientific article; zbMATH DE number 515933 (Why is no real title available?)
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks

This page was built for publication: A computational comparison of the network simplex method with the dual affine scaling method

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