Affiliation:
1. Wayne State University, USA
2. Amirkabir University of Technology, Iran
Abstract
In this chapter, some applications of network flow problems are addressed based on each type of problem being discussed. For example, in the case of shortest path problems, their concept in facility layout, facility location, robotics, transportation, and very large-scale integration areas are pointed out in the first section. Furthermore, the second section deals with the implementation of the maximum flow problem in image segmentation, transportation, web communities, and wireless networks and telecommunication areas. Moreover, in the third section, the minimum-cost flow problem is discussed in fleeting and routing problems, petroleum, and scheduling areas. Meanwhile, a brief explanation about each application as well as some corresponding literature and research papers are presented in each section. In addition, based on available literature in each of these areas, some research gaps are identified, and future trends as well as chapter’s conclusion are pointed out in the fourth section.
Reference41 articles.
1. Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
2. Anderson, L. B., Atwell, R. J., Barnett, D. S., & Bovey, R. L. (2007). Application of the maximum flow problem to sensor placement on urban road networks for homeland security. Homeland Security Affairs, 3(3), 1-15. Retrieved February 15, 2011, from http://www.hsaj.org/?article=3.3.4
3. Solving the bicriterion routing and scheduling problem for hazardous materials distribution
4. Pseudo Approximation Algorithms with Applications to Optimal Motion Planning
5. Mining communities on the Web using a max-flow and a site-oriented framework. IEICE - Transactions on Information and Systems;Y.Asano;E (Norwalk, Conn.),2006