最小费用流问题用于求解，图论中两地区运输费用最少的问题，本程序通过MATLAB解决这一问题-For solving the minimum cost flow problem in graph theory two least-cost regional transportation issues, the procedure to solve this problem through MATLAB

流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少-Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs

考虑到通信网络结点的可靠性，若要求任意一个结点出现故障时，其它结点间仍然能够保持通信畅通的可能性都达到90 ，请建立问题的数学模型，设计求解算法，并给出使总铺设费用最少的铺设方案-Considering the reliability of communication network nodes, if you want any one node fails, you can still keep communication flowing between the possibility of