APPLICATION PROBLEM OF MAXIMUM FLOW WITH MINIMUM COST FOR PRESENTATION OF CARRIER TRANSPORTATION IN QUANG BINH

Abstract

The problem of maximum flow in the network has many applications in practice: Problem identified maximal intensity of transport stream between two nodes of a traffic map, the problem of finding threading biggest oil can be pumped from tanker to storage tanks of a system of oil pipelines ... in addition, the application of the problem was to solve problems like: problem wedding rural areas, the problem of representation systems generally, math assignment group activities, scheduling problem for the conference ... This research presents the application problem of maximum flow at a cost minima (a variant of the problem of maximum flow in the network) to build apps working aid to transport flood relief. The app aims to come up with a plan to transport the maximum amount of goods, enough food supply for people in flooded areas but ensure the shipping cost is minimal.