%0 Journal Article %1 natarajanmeghanathanjacksonstateuniversity2017balancing %A Ziauddin Ursani, Ahsan A. Ursani %A Corne, David W. %D 2015 %E Natarajan Meghanathan, Jackson State University, USA %J International Journal of Computer Networks & Communications (IJCNC) %K Balancing Flow Graph Mass Networks, Optimisation Theorem, Theory, %N 6 %P 17-31 %T A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATION %U http://aircconline.com/ijcnc/V7N6/7615cnc02.pdf %V 2015 %X A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the network, consequently reducing economic costs for flow-maximization in such networks

@article{natarajanmeghanathanjacksonstateuniversity2017balancing, abstract = {A mass balancing theorem (MBT) was recently introduced, concerning the role of 'unbalanced nodes' in the optimization of network flow. The MBT discovers and proves a flow-balancing property, which can be exploited in the design of network flow algorithms. Subsequently a number of such applications of the MBT have been explored for various types of flow-networks. These have included, in particular, single and multiple commodity networks with additional equipment of separators, which are present in various real world scenarios including the oil and gas industry. In this paper, the mass balancing theorem is revisited,and further developed to consider new network examples with embedded cycles. In doing so, algorithms based on the mass balancing method are extended to remove any undesirably saturated edges in the network, consequently reducing economic costs for flow-maximization in such networks }, added-at = {2017-01-18T04:03:09.000+0100}, author = {Ziauddin Ursani, Ahsan A. Ursani and Corne, David W.}, biburl = {https://www.bibsonomy.org/bibtex/25e9dff5967a3f97a10877438329a20dd/laimbee}, editor = {{Natarajan Meghanathan, Jackson State University}, USA}, interhash = {b0b6b871c6b0ecd71331526280355c27}, intrahash = {5e9dff5967a3f97a10877438329a20dd}, journal = {International Journal of Computer Networks & Communications (IJCNC)}, keywords = {Balancing Flow Graph Mass Networks, Optimisation Theorem, Theory,}, month = {November }, number = 6, pages = {17-31}, timestamp = {2017-01-18T04:04:58.000+0100}, title = { A MASS BALANCING THEOREM FOR THE ECONOMICAL NETWORK FLOW MAXIMISATION }, url = {http://aircconline.com/ijcnc/V7N6/7615cnc02.pdf}, volume = 2015, year = 2015 }