IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-33012-4_82.html
   My bibliography  Save this book chapter

Algorithm for Solving the Complicated Maximum Flow in Networks Based on the Interrelationship Tables

In: Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012)

Author

Listed:
  • Xu-ying Zhu

    (Kunming University of Science and Technology)

  • Kai-hu Hou

    (Kunming University of Science and Technology)

  • Jin-yuan Zhong

    (Kunming University of Science and Technology)

  • Lin Yang

    (Kunming University of Science and Technology)

Abstract

In this paper, we focused on the weighted networks system balance relationship between supply and demand to solve the network maximum flow problem under giant complicated environment. A heuristic solution method was proposed which was based on the interrelationship tables. The data was stored in the interrelationship tables according to the method which was defined and discussed on the model whose main part was list structure. The algorithm calculating showed a high efficiency in the condition of many disturbed factors were included while analyzing weighted networks. This algorithm was effectively proved by designed calculating examples. It could improve the visual degree of inherent relationship network and show superiority on solving complex network problems. This algorithm can supply model structure and operating basis on the aspect of solving maximum flow problems with the help of a computer. And it can also expand the researching methods of intelligent network system.

Suggested Citation

  • Xu-ying Zhu & Kai-hu Hou & Jin-yuan Zhong & Lin Yang, 2013. "Algorithm for Solving the Complicated Maximum Flow in Networks Based on the Interrelationship Tables," Springer Books, in: Runliang Dou (ed.), Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), edition 127, chapter 0, pages 823-833, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-33012-4_82
    DOI: 10.1007/978-3-642-33012-4_82
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-33012-4_82. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.