The bottleneck analysis of the minimum cost problem for the generalized network (MCPGN) is discussed. The analysis is based on the network simplex algorithm, which gains negative cost graphs by constructing augmented ...The bottleneck analysis of the minimum cost problem for the generalized network (MCPGN) is discussed. The analysis is based on the network simplex algorithm, which gains negative cost graphs by constructing augmented forest structure, then augments flows on the negative cost graphs until the optimal revolution is gained. Bottleneck structure is presented after analyzing the augmented forest structure. The negative cost augmented graphs are constructed with the bottleneck structure. The arcs that block the negative cost augmented graph are the elements of the bottleneck. The bottleneck analysis for the generalized circulation problem, the minimum circulation problem and the circulation problem are discussed respectively as the basal problems, then that for MCPGN is achieved. An example is presented at the end.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60174046).
文摘The bottleneck analysis of the minimum cost problem for the generalized network (MCPGN) is discussed. The analysis is based on the network simplex algorithm, which gains negative cost graphs by constructing augmented forest structure, then augments flows on the negative cost graphs until the optimal revolution is gained. Bottleneck structure is presented after analyzing the augmented forest structure. The negative cost augmented graphs are constructed with the bottleneck structure. The arcs that block the negative cost augmented graph are the elements of the bottleneck. The bottleneck analysis for the generalized circulation problem, the minimum circulation problem and the circulation problem are discussed respectively as the basal problems, then that for MCPGN is achieved. An example is presented at the end.
