scientific article; zbMATH DE number 5371757

MaRDI QIDQ3538737zbMATH OpenFDO

Authors Dongdong Xie, Yuxian Gai, Xiaoqiu Jia, Fang-Yu Li

Publication date 24 November 2008

zbMATH Keywords

lossmaximum flownetworkshortest path

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Recommendations

• Shortest path and maximum flow problems in networks with additive losses and gains
• Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
• Algorithms for maximum network flow
• scientific article; zbMATH DE number 706868
• Maximum network flows with concave gains
• scientific article; zbMATH DE number 934460
• Sensitive and parametric analysis of the maximum flow in a network
• The maximum flow in dynamic networks
• Approximation algorithm for maximum flow network interdiction problem

Cited in

(3)

• Loss strategies for competing AIMD flows
• Algorithm model research of the logical cutting tree on the network maximum flow
• Shortest path and maximum flow problems in networks with additive losses and gains

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 Q3538737)