Grafos: flujo máximo a coste mínimo con algoritmo de BUSACKER-GOWEN | | UPV

Title: Graphs: Maximum Flow at Minimum Cost with the BUSACKER-GOWEN Algorithm Description: Solving an example problem of maximum flow at minimum cost in a graph using the BUSACKER-GOWEN algorithm. Miralles Insa, CJ. (2021). Graphs: Maximum Flow at Minimum Cost with the BUSACKER-GOWEN Algorithm. Universitat Politècnica de València. http://hdl.handle.net/10251/167539 Automatic description: In this video, the professor explains the maximum flow at minimum cost problem in graph theory, using a specific algorithm. The objective is to send the maximum amount of flow from an initial node to an end node in a network, minimizing the cost associated with the transfer. The problem is defined and the application of the algorithm is shown through a practical example. Two graphs are distinguished: one of costs and one of flows. The algorithm's operation is described, which involves two steps: finding the most economical route and then moving the largest amount of flow allowed along that route. A well-known algorithm is used to find optimal paths, and when negative costs arise, another well-known algorithm is used. By iterating this process, paths are saturated and the cost graph is adjusted, blocking already saturated routes and searching for alternatives. Eventually, a solution is reached where no more routes can be drawn, and the optimal flow at minimum cost is obtained. The video interprets the solution by subtracting the obtained flows from the initial graph to clarify the final distribution. The result is a total flow of 53 units with a cost of €584,000. The conclusion is emphasized by highlighting that the method used is heuristic and can be adapted to the decision-maker's preferences, taking into account the multi-objective nature of the problem. Author: Miralles Insa Cristóbal Javier Polytechnic University of Valencia (UPV): https://www.upv.es More videos at:    / valenciaupv   Access our MOOCs: https://upvx.es #Graphs #Maximum flow #Minimum cost #BUSACKER-GOWEN algorithm #BUSINESS ORGANIZATION #1207 - Operations research