Minimal cost flow in processing networks : a primal approach

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

[1]  T. Koopmans.  Optimum Utilization of the Transportation System , 1949 .

[2]  D. R. Fulkerson,et al.  An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[3]  Richard D. McBride.  A Spike Collective Dynamic Factorization Algorithm for the Simplex Method , 1978 .

[4]  K. G. Ramakrishnan.  Solving Two-Commodity Transportation Problems with Coupling Constraints , 1980, JACM.

[5]  Fred W. Glover,et al.  Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently , 1975, TOMS.

[6]  J. Koene.  A primal-dual algorithm for solving a maximal flow problem in a class of networks with gains , 1979 .

[7]  Lawrence Bodin,et al.  Current and future research directions in network optimization , 1981, Comput. Oper. Res..

[8]  P. Hall.  On Representatives of Subsets , 1935 .

[9]  I. Duff.  A survey of sparse matrix research , 1977, Proceedings of the IEEE.

[10]  Harvey J. Greenberg,et al.  Design and implementation of optimization software , 1977, Math. Program..

[11]  V. Srinivasan,et al.  Determining All Nondegenerate Shadow Prices for the Transportation Problem , 1977 .

[12]  O. H. Brownlee,et al.  ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[13]  Ellis L. Johnson,et al.  Networks and Basic Solutions , 1966, Oper. Res..

[14]  Darwin Klingman,et al.  Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[15]  Robert M. Crisp,et al.  Linear Programming: A Survey of General Purpose Algorithms , 1975 .

[16]  Andrew B. Whinston,et al.  Optimization over Leontief substitution systems , 1975 .

[17]  G. H. Bradley.  Survey of Deterministic Networks , 1975 .

[18]  G. Bennington.  An Efficient Minimal Cost Flow Algorithm , 1973 .

[19]  L. Schrage.  SOME COMMENTS ON HIDDEN STRUCTURE IN LINEAR PROGRAMS , 1981 .

[20]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[21]  J. Kennington.  Solving multicommodity transportation problems using a primal partitioning simplex technique , 1977 .

[22]  Fred Glover,et al.  A Network Augmenting Path Basis Algorithm for Transshipment Problems , 1978 .

[23]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[24]  Jf Benders,et al.  A decision support system for location and allocation problems within a brewery , 1982 .

[25]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[26]  Jeffery L. Kennington,et al.  Primal simplex network codes: State-of-the-art implementation technology , 1978, Networks.

[27]  F. Gustavson.  FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX , 1976 .

[28]  Fred W. Glover,et al.  Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[29]  H. Albert Napier,et al.  Optimal Multi-Level Lot Sizing for Requirements Planning Systems , 1980 .

[30]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[31]  Jean François Maurras,et al.  Optimization of the flow through networks with gains , 1972, Math. Program..

[32]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

[33]  John M. Dutton,et al.  Managerial planning with linear programming: In process industry operations , 1978 .

[34]  Kurt Eisemann,et al.  The Generalized Stepping Stone Method for the Machine Loading Model , 1964 .

[35]  John S. Edwards,et al.  Linear Programming and Finite Markovian Control Problems , 1983 .

[36]  Darwin Klingman,et al.  The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .

[37]  Gerald G. Brown,et al.  Automatic Identification of Embedded Structure in Large-Scale Optimization Models , 1981 .

[38]  Darwin Klingman,et al.  Solving Constrained Transportation Problems , 1972, Oper. Res..

[39]  Iain S. Duff,et al.  On Permutations to Block Triangular Form , 1977 .

[40]  K. B. Haley,et al.  Programming, Games and Transportation Networks , 1966 .

[41]  T. D. Howell.  Partitioning Using PAQ , 1975 .

[42]  D. R. Fulkerson,et al.  A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .

[43]  John K. Reid,et al.  An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix , 1978, TOMS.

[44]  Fred Glover,et al.  A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[45]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[46]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[47]  Darwin Klingman,et al.  RECENT DEVELOPMENTS IN COMPUTER IMPLEMENTATION TECHNOLOGY FOR NETWORK FLOW ALGORITHMS , 1982 .

[48]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[49]  Reeta Gupta.  Solving the Generalized Transportation Problem with Constraints , 1978 .

[50]  A. Charnes,et al.  Management Models and Industrial Applications of Linear Programming , 1961 .

[51]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[52]  Fred W. Glover,et al.  An improved version of the out-of-kilter method and a comparative study of computer codes , 1974, Math. Program..

[53]  John W. Hultz,et al.  Solving Constrained Generalized Network Problems. , 1976 .

[54]  John K. Reid,et al.  Algorithm 529: Permutations To Block Triangular Form [F1] , 1978, TOMS.

[55]  F. Glover.  CREATING NETWORK STRUCTURE IN LP'S , 1981 .

[56]  A. F. Veinott.  Extreme points of leontief substitution systems , 1968 .

[57]  J. Koene.  A Primal Simplex algorithm for the minimal cost flow problem in a processing network , 1981 .

[58]  Iain S. Duff,et al.  On Algorithms for Obtaining a Maximum Transversal , 1981, TOMS.

[59]  Doris R. Ryan,et al.  A comparison of three algorithms for finding fundamental cycles in a directed graph , 1981, Networks.

[60]  Fred W. Glover,et al.  On the equivalence of some generalized network problems to pure network problems , 1973, Math. Program..

[61]  R. Bixby.  HIDDEN STRUCTURE IN LINEAR PROGRAMS , 1981 .

[62]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[63]  Fred W. Glover,et al.  A Strongly Convergent Primal Simplex Algorithm for Generalized Networks , 1979, Math. Oper. Res..

[64]  M. Saunders.  Large-scale linear programming using the Cholesky factorization , 1972 .