scientific article; zbMATH DE number 1116645

MaRDI QIDQ4376325zbMATH OpenFDO

Authors Xuanxi Ning

Publication date 10 February 1998

zbMATH Keywords

graph simplex algorithmminimal flow problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1092852
• scientific article; zbMATH DE number 1164085
• The minimum cover flow problem in networks
• Minimal blocking flow in networks
• scientific article; zbMATH DE number 988194

Cited in

(5)

• Network simplex algorithm for the general equal flow problem.
• Minimal blocking flow in networks
• scientific article; zbMATH DE number 1092852 (Why is no real title available?)
• scientific article; zbMATH DE number 1164085 (Why is no real title available?)
• The minimum spanning flow in a network and its self‐organization principle

This page was built for publication:

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