Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Development and research of the algorithm for determining the maximum flow at distribution in the network

Development and research of the algorithm for determining the maximum flow at distribution in the... AbstractAn upgraded version of Ford-Fulkerson algorithmis proposed, which allows to determine the maximumflow and the distribution flow in branches of the network.Results of simulation using this algorithm are given.They show its effectiveness in comparison with the othervariants of flow distribution in the network at change ofthe capacity of branches randomly in time. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Open Computer Science de Gruyter

Development and research of the algorithm for determining the maximum flow at distribution in the network

Download PDF
6 pages

Loading next page...
 
/lp/de-gruyter/development-and-research-of-the-algorithm-for-determining-the-maximum-7Gqj8uUs4c

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
© 2016 A. Akhmediyarova et al.
eISSN
2299-1093
DOI
10.1515/comp-2016-0017
Publisher site
See Article on Publisher Site

Abstract

AbstractAn upgraded version of Ford-Fulkerson algorithmis proposed, which allows to determine the maximumflow and the distribution flow in branches of the network.Results of simulation using this algorithm are given.They show its effectiveness in comparison with the othervariants of flow distribution in the network at change ofthe capacity of branches randomly in time.

Journal

Open Computer Science – de Gruyter

Published: Jan 1, 2016

References

  • Equipment for traflc management in urban areas
    Kaptanov
  • Road Traflc Organization Textbook for high schools th ed Revised and ext
    Klinkovshteyn
  • construction and analysis nd ed
    Thomas
  • Investigation of Some Problems of Mathematical Systems Theory for Multistep Processes
    Gaishun
  • Traflc Management
    Inose
  • Theory of traflc flowandmanagement
    Drew
  • Tutorial Publishing House Slovo
    Zaichenko