Algorithms for minimum flows. Dynamic tree implementations

MaRDI QIDQ2857263zbMATH OpenFDO

Authors Oana Georgescu

Publication date 31 October 2013

Published in Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)

zbMATH Keywords

network flownetwork algorithmsminimum flow problemdynamic tree

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited in

(2)

• Use of dynamic trees in a network simplex algorithm for the maximum flow problem
• scientific article; zbMATH DE number 828003 (Why is no real title available?)

This page was built for publication: Algorithms for minimum flows. Dynamic tree implementations

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