An efficient scaling procedure for gain networks

DOI10.1002/NET.3230060207MaRDI QIDQ4096689zbMATH OpenOpenAlexFDO

Authors Klaus Truemper

Publication date 1976

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230060207

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• The analytic methods of operations research
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(2)

• On the complexity of recognizing a class of generalized networks
• The structure of bases in bicircular matroids

This page was built for publication: An efficient scaling procedure for gain networks

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