Numerical methods for basic solutions of generalized flow networks

DOI10.1007/BFB0121014MaRDI QIDQ3220317zbMATH OpenOpenAlexFDO

Authors Tau Hsu, M. D. Grigoriadis

Publication date 1984

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121014

zbMATH Keywords

computational comparisonconnected subgraphGaussian eliminationlarge minimum cost generalized network flow problemsone-tree systemssimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Design and Implementation of Data Structures for Generalized Networks
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 795215
• An efficient implementation of the network simplex method
• Network flow problems with one side constraint: A comparison of three solution methods

Cited in

(5)

• New labeling procedures for the basis graph in generalized networks
• On the minimization of a class of generalized linear functions on a flow polytope
• Design and Implementation of Data Structures for Generalized Networks
• scientific article; zbMATH DE number 18948 (Why is no real title available?)
• The basis suppression method

This page was built for publication: Numerical methods for basic solutions of generalized flow networks

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