A Primal Simplex Approach to Pure Processing Networks
针对纯处理网络（一种节点流量按比例约束的最小费用流问题）提出新的理论结果和两种原单纯形变体，其中一种实现后比通用线性规划代码快一个数量级。
Pure processing network problems are minimum cost flow problems in which the flow entering or leaving a node may be constrained to do so in given proportions. In this paper, new theoretical results concerning pure processing networks are developed, and, based on these results, two new primal simplex variants are presented. One of these variants has been implemented and tested against a general purpose linear programming code. A large class of problems is identified for which the specialized code is an order of magnitude faster than the general purpose code.