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

zbMATH Open0729.90062MaRDI QIDQ806669

Sanjay Mehrotra, Andrew P. Armacost

Publication date: 1991

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

transportationassignmentdual affine scaling methodnetwork simplex methodminimum cost network flowcomplete Cholesky factors

Mathematics Subject Classification ID

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

Related Items (1)

An affine scaling method for solving network flow problems

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)