The Study Of Network Maximal-flow Problem And The Location Of The Recycling Center

This thesis studies the network maximal-?ow problem and the location of therecycling center.The network maximal-?ow problem is not only a classical combinatorial op-timization problem, but also a special linear programming problem. It has a widevariety of applications in engineering fields such as communication, electric power,transportation, etc., and scientific fields such as physics, chemistry, biology, ap-plied mathematic, etc.. The problem has been studied for more than forty years.Many researchers, including Turing Prize winners Karp and Tarjan, have estab-lished integrate theories and explored many algorithms for the problem. On theother hand, however, the research in the maximal-?ow model varies is relativelyfewer. With the rapid development of networks maximal-?ow becomes more andmore important and has attracted much people s attention.On the base of traditional network maximum ?ow model, this thesis studiesnetwork maximum ?ow model with more than one source and sink in di?erentsub-network. We also propose a decomposition method to solve the model.A complete supply chain system includes not only the forward logistics, butalso reverse logistics. It has pasted a very long time since the enterprises payattention to the return products and overdone products. With environmentalconsciousness enhancement, environmental protection legislation s releasing andthe considerable economic interest s appearance, the enterprises start to pay at-tention to the reverse logistics. Reverse logistics has become the warm topic. Theresearch in this topic has taken good progress. As the important link of reverselogistics network, the location of recycling center plays an important role in theentire logistics system.In this thesis, we will also study the location of recycling center and the returnprice.