A survey of dynamic network flows

Dynamic network flow models describe network-structured, decision-making problems over time. They are of interest because of their numerous applications and intriguing dynamic structure. The dynamic models are specially structured problems that can be solved with known general methods. However, specialized techniques have been developed to exploit the underlying dynamic structure. Here, we present a state-of-the-art survey of the results, applications, algorithms and implementations for dynamic network flows.

[1]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[2]  Malachy Carey,et al.  Congested network flows: Time-varying demands and start-time policies , 1988 .

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

[4]  H Herren.  THE DISTRIBUTION OF EMPTY WAGONS BY MEANS OF COMPUTER. AN ANALYTICAL MODEL OF THE SWISS FEDERAL RAILWAYS , 1974 .

[5]  Earl R. Barnes,et al.  A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..

[6]  Mark S. Daskin,et al.  A combined model of train routing, makeup, and empty car distribution , 1987 .

[7]  A. Ali,et al.  The equal flow problem , 1988 .

[8]  Gerald G. Brown,et al.  Extracting embedded generalized networks from linear programming problems , 1985, Math. Program..

[9]  Patrick Rivett,et al.  Principles of Operations Research , 1972 .

[10]  K. B. Haley,et al.  New Methods in Mathematical Programming---The Solid Transportation Problem , 1962 .

[11]  Amos Levin.  Some fleet routing and scheduling problems for air transportation systems , 1969 .

[12]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[13]  David F. Shanno,et al.  Computing Karmarkar projections quickly , 1988, Math. Program..

[14]  Eugene Lawler,et al.  Combinatorial optimization , 1976 .

[15]  George Gross,et al.  PGandE's State-of-the-Art Scheduling Tool for Hydro Systems , 1986 .

[16]  Malachy Carey,et al.  A Constraint Qualification for a Dynamic Traffic Assignment Model , 1986, Transp. Sci..

[17]  Richard Waddell,et al.  A Model for Equipment Replacement Decisions and Policies , 1983 .

[18]  Suresh Chand,et al.  Planning Horizon Procedures for Machine Replacement Models with Several Possible Replacement Alternatives , 1982 .

[19]  Stella Dafermos,et al.  The general multimodal network equilibrium problem with elastic demand , 1982, Networks.

[20]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[21]  Santosh Kumar,et al.  The Routing Problem with "K" Specified Nodes , 1966, Oper. Res..

[22]  Darwin Klingman,et al.  Mathematical Optimization--A Successful Tool for Logistics Problems. , 1981 .

[23]  Humberto Florez,et al.  EMPTY-CONTAINER REPOSITIONING AND LEASING: AN OPTIMIZATION MODEL. , 1986 .

[24]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[25]  Anthony J. Zahorik,et al.  Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .

[26]  A Dynamic Marketing Network with Monopsonistic Acquisition and Perfectly Competitive Disposition , 1983 .

[27]  H. W. Hamacher.  ORSEP (operations research software exchange program): ORSEP—Operations Research Software Exchange Program , 1989 .

[28]  Jonathan Halpern,et al.  A generalized dynamic flows problem , 1979, Networks.

[29]  D. Klingman,et al.  An Optimization Based Integrated Short-Term Refined Petroleum Product Planning System , 1987 .

[30]  Fred W. Glover,et al.  A practitioner's guide to the state of large scale network and network-related problems , 1976, AFIPS '76.

[31]  Kenneth C. Gilbert,et al.  MULTIDIMENSIONAL ASSIGNMENT PROBLEMS , 1988 .

[32]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[33]  Leon S. Lasdon,et al.  A Reduced Gradient Algorithm for Nonlinear Network Problems , 1983, TOMS.

[34]  Don T. Phillips,et al.  Fundamentals Of Network Analysis , 1981 .

[35]  Gerald L. Thompson,et al.  A Dynamic Space-Time Network Flow Model for City Traffic Congestion , 1987, Transp. Sci..

[36]  W. L. Wilkinson,et al.  Min/max bounds for dynamic network flows , 1973 .

[37]  Maurice Snowdon,et al.  Network Flow Programming , 1980 .

[38]  Kenneth R. Baker,et al.  Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements , 1974 .

[39]  Yen-Shwin Shan.  A dynamic multicommodity network flow model for real time optimal rail freight car management , 1985 .

[40]  Paul Tseng,et al.  Relaxation methods for problems with strictly convex separable costs and linear constraints , 1987, Math. Program..

[41]  Darwin Klingman,et al.  New Advances in the Solution of Large-Scale Network and Network-Related Problems. , 1974 .

[42]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[43]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[44]  H. D. Ratliff,et al.  Unnetworks, with Applications to Idle Time Scheduling , 1978 .

[45]  M. Vlach,et al.  Letter to the Editor - On the Necessary Conditions for the Existence of the Solution of the Multi-Index Transportation Problem , 1967, Oper. Res..

[46]  Willard I. Zangwill,et al.  Eliminating inventory in a series facility production system , 1987 .

[47]  R. W. Klessig,et al.  An algorithm for nonlinear multicommodity flow problems , 1974, Networks.

[48]  Gerald L. Thompson,et al.  The pivot and probe algorithm for solving a linear program , 1984, Math. Program..

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

[50]  Teodor Gabriel Crainic,et al.  Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation , 1987, Transp. Sci..

[51]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming I: Derivation and proof , 1985, Math. Program..

[52]  K. B. Williams,et al.  A Practical Application of Linear Programming in the Mining Industry , 1959 .

[53]  Ronald F. Kirby,et al.  The minimum route problem for networks with turn penalties and prohibitions , 1969 .

[54]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[55]  Hiroshi Konno.  Minimum concave cost production system: A further generalization of multi-echelon model , 1988, Math. Program..

[56]  A. Charnes,et al.  Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design , 1969 .

[57]  C. Fong,et al.  The multiregional dynamic capacity expansion problem: an improved heuristic , 1986 .

[58]  G. Nemhauser,et al.  Integer Programming , 2020 .

[59]  Egon Balas,et al.  Traffic assignment in communication satellites , 1983 .

[60]  Darwin Klingman,et al.  Improved Labeling of L.P. Bases in Networks , 1975 .

[61]  Horst W. Hamacher,et al.  Modeling of building evacuation problems by network flows with side constraints , 1988 .

[62]  Stella Dafermos,et al.  An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .

[63]  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.

[64]  James K. Ho,et al.  Computational experience with advanced implementation of decomposition algorithms for linear programming , 1983, Math. Program..

[65]  Warren B. Powell,et al.  A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM , 1988 .

[66]  Paul H. Zipkin,et al.  An improved disaggregation method for transportation problems , 1983, Math. Program..

[67]  Andy Philpott,et al.  Network Programming in Continuous Time with Node Storage , 1985 .

[68]  Gerald L. Thompson,et al.  A Forward Algorithm for the Capacitated Lot Size Model with Stockouts , 1990, Oper. Res..

[69]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[70]  Warren B. Powell,et al.  THE DYNAMIC VEHICLE ALLOCATION PROBLEM WITH UNCERTAIN DEMANDS , 1987 .

[71]  A L Kornhauser,et al.  USER AND SYSTEM OPTIMAL FORMULATION AND SOLUTION TO THE SHARED RAIL FLEET MANAGEMENT PROBLEM , 1986 .

[72]  R. Fourer,et al.  Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics , 1988 .

[73]  W B Powell,et al.  SENSITIVITY ANALYSIS OF DYNAMIC NETWORKS: AN APPLICATION TO PRICING AND LOAD EVALUATION FOR TRUCKLOAD MOTOR CARRIERS , 1988 .

[74]  Richard L. Francis,et al.  Network models for building evacuation , 1982 .

[75]  W. H. Cunningham,et al.  Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..

[76]  Fred W. Glover,et al.  Past, present and future of large scale transshipment computer codes and applications , 1975, Comput. Oper. Res..

[77]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[78]  Michael J. Todd,et al.  Exploiting special structure in Karmarkar's linear programming algorithm , 1988, Math. Program..

[79]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[80]  William P. Pierskalla,et al.  Letter to the Editor - The Multidimensional Assignment Problem , 1968, Oper. Res..

[81]  Rema Padman,et al.  Dual Algorithms for Pure Network Problems , 1989, Oper. Res..

[82]  Dimitri P. Bertsekas,et al.  A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..

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

[84]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

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

[86]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[87]  Anna Nagurney,et al.  Parallel and Serial Variational Inequality Decomposition Algorithms for Multicommodity Market Equilibrium Problems , 1989, Int. J. High Perform. Comput. Appl..

[88]  D. Bartholomew,et al.  Linear Programming: Methods and Applications , 1970 .

[89]  Veena B. Mendiratta.  A dynamic optimization model of the empty car distribution process , 1981 .

[90]  Darwin Klingman,et al.  Strategic Management of Multinational Companies: Network-Based Planning Systems. , 1979 .

[91]  David Gale,et al.  Transient flows in networks. , 1959 .

[92]  Michael A. Saunders,et al.  MINOS/AUGMENTED User's Manual. , 1980 .

[93]  S. Sethi,et al.  The Dynamic Transportation Problem: A Survey , 1980 .

[94]  Darwin Klingman,et al.  Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (Distribution) Problem , 1972 .

[95]  Suresh Chand,et al.  Planning Horizon Procedures for Machine Replacement Models , 1979 .

[96]  Louis W. Miller.  Using Linear Programming to Derive Planning Horizons for a Production Smoothing Problem , 1979 .

[97]  F. Glover,et al.  The simplex SON algorithm for LP/embedded network problems , 1981 .

[98]  Donald R. Smith,et al.  Multiperiod allocation of limited resources: A minimax approach , 1988 .

[99]  Maurizio Bielli,et al.  The air traffic flow control problem as an application of network theory , 1982, Comput. Oper. Res..

[100]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[101]  R. R. Vemuganti,et al.  Network Models for Fleet Management , 1989 .

[102]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[103]  James J. Solberg,et al.  Operations Research: Principles and Practice. , 1977 .

[104]  Darwin Klingman,et al.  Augmented Threaded Index Method for Network Optimization. , 1974 .

[105]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

[106]  Thomas E. Morton,et al.  Universal Planning Horizons for Generalized Convex Production Scheduling , 1978, Oper. Res..

[108]  Fred W. Glover,et al.  Layering strategies for creating exploitable structure in linear and integer programs , 1988, Math. Program..

[109]  Gerald L. Thompson,et al.  A Forward Simplex Method for Staircase Linear Programs , 1985 .

[110]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[111]  Abraham Charnes,et al.  MULTI-DIMENSIONAL AND DYNAMIC ASSIGNMENT MODELS WITH SOME REMARKS ON ORGANIZATION DESIGN. , 1968 .

[112]  P. Nash,et al.  A Class of Continuous Network Flow Problems , 1982, Math. Oper. Res..

[113]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[114]  Bernard Yaged.  Economies of Scale, Networks, and Network Cost Elasticity , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[115]  Jay E. Aronson,et al.  A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems , 1989, Comput. Oper. Res..

[116]  J. A. Tomlin,et al.  Special ordered sets and an application to gas supply operations planning , 1988, Math. Program..

[117]  Robert R. Meyer,et al.  Parallel optimization for traffic assignment , 1988, Math. Program..

[118]  L F Frantzeskakis,et al.  DEVELOPMENT AND EVALUATION OF A SUCCESSIVE LINEAR APPROXIMATION PROCEDURE FOR STOCHASTIC, DYNAMIC NETWORKS , 1988 .

[119]  William W. White,et al.  A Network Algorithm for Empty Freight Car Allocation , 1969, IBM Syst. J..

[120]  Donald L. Miller,et al.  Solution of large dense transportation problems using a parallel primal algorithm , 1990 .

[121]  Warren B. Powell,et al.  OR Practice - Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry , 1989, Oper. Res..

[122]  D. Klingman,et al.  The Challenges and Success Factors in Implementing an Integrated Products Planning System for Citgo , 1986 .

[123]  L. Escudero.  Performance evaluation of independent superbasic sets on nonlinear replicated networks , 1986 .

[124]  K. B. Haley,et al.  The Existence of a Solution to the Multi-Index Problem , 1965 .

[125]  K. Haley.  The Multi-Index Problem , 1963 .

[126]  T. E. Bartlett,et al.  An algorithm for the minimum number of transport units to maintain a fixed schedule , 1957 .

[127]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[128]  Thomas L. Magnanti,et al.  Deterministic network optimization: A bibliography , 1977, Networks.

[129]  Hanif D. Sherali,et al.  LARGE-SCALE NETWORK DISTRIBUTION OF POOLED EMPTY FREIGHT CARS OVER TIME, WITH LIMITED SUBSTITUTION AND EQUITABLE BENEFITS , 1985 .

[130]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[131]  Stavros A. Zenios,et al.  Parallel Numerical Optimization: Current Status and an Annotated Bibliography , 1989, INFORMS J. Comput..

[132]  Robert L. Smith,et al.  Aggregation in Dynamic Programming , 1987, Oper. Res..

[133]  Jay E. Aronson.  The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm , 1986 .

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

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

[136]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[137]  William C. Jordan,et al.  A STOCHASTIC, DYNAMIC NETWORK MODEL FOR RAILROAD CAR DISTRIBUTION , 1983 .

[138]  William H. Cunningham,et al.  A network simplex method , 1976, Math. Program..

[139]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[140]  Charles J. McCallum.  A generalized upper bounding approach to a communications network planning problem , 1977, Networks.

[141]  D. Gale.  A theorem on flows in networks , 1957 .

[142]  Paul Tseng,et al.  Relaxation methods for monotropic programming problems , 1986 .

[143]  Arthur F. Veinott,et al.  Optimal Capacity Scheduling---II , 1962 .

[144]  Calvin C. Gotlieb,et al.  The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.

[145]  Robert Fourer,et al.  A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy , 1988, Math. Program..

[146]  Fred W. Glover,et al.  The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems , 1977, ACM '77.

[147]  Egon Balas,et al.  Facets of the three-index assignment polytope , 1989, Discret. Appl. Math..

[148]  Darwin Klingman,et al.  IMPROVED COMPUTER-BASED PLANNING TECHNIQUES , 1977 .

[149]  V. Srinivasan,et al.  The Multiregion Dynamic Capacity Expansion Problem, Part I , 1981, Oper. Res..

[150]  Anna Nagurney,et al.  Sensitivity Analysis for the General Spatial Economic Equilibrium Problem , 1984, Oper. Res..

[151]  John M. Mulvey,et al.  A distributed algorithm for convex network optimization problems , 1988, Parallel Comput..

[152]  William L. Maxwell,et al.  Dynamic Network Flow Modelling of Fixed Path Material Handling Systems , 1981 .

[153]  Chou-Hong J. Chen,et al.  A Primal Simplex Approach to Pure Processing Networks , 1986 .

[154]  Te Chiang Hu,et al.  Network analysis of production smootewg , 1959 .

[155]  Roy L. Crum,et al.  A network model of insurance company cash flow management , 1981 .

[156]  Jonathan D. Stanley,et al.  A forward convex-simplex method , 1987 .

[157]  J. E. Aronson,et al.  The solution of multiperiod personnel planning problems by the forward simplex method , 1985 .

[158]  Warren B. Powell,et al.  Mitigating end effects in the dynamic vehicle allocation model , 1988 .

[159]  Jacob Intrator,et al.  Auxiliary procedures for solving long transportation problems , 1980 .

[160]  Warren B. Powell,et al.  A Stochastic Model of the Dynamic Vehicle Allocation Problem , 1986, Transp. Sci..

[161]  Mark A. Turnquist,et al.  MODEL FOR MANAGEMENT OF EMPTY FREIGHT CARS , 1982 .

[162]  John Wesley Hultz.  Algorithms and applications for generalized networks. , 1976 .

[163]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[164]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[165]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[166]  Leon F McGinnis,et al.  Optimal Lot-Sizing in Acyclic Multiperiod Production Systems, , 1983 .

[167]  E P Allen.  USING TWO SEQUENCES OF PURE NETWORK PROBLEMS TO SOLVE THE MULTICOMMODITY NETWORK FLOW PROBLEM , 1985 .

[168]  A. Ali,et al.  Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms , 1980, Oper. Res..

[169]  V. Srinivasan.  A Transshipment Model for Cash Management Decisions , 1974 .

[170]  Norman Zadeh,et al.  On building minimum cost communication networks over time , 1974, Networks.

[171]  F. S. Hillier,et al.  Introduction to Operations Research, 10th ed. , 1986 .

[172]  Bruce E. Hajek,et al.  Optimal dynamic routing in communication networks with continuous traffic , 1982, 1982 21st IEEE Conference on Decision and Control.

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

[174]  Gerald L. Thompson,et al.  Solution of constrained generalized transportation problems using the pivot and probe algorithm , 1986, Comput. Oper. Res..

[175]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[176]  A. Charnes,et al.  Part II ‐ Generalization and analysis , 1957 .

[177]  Amedeo Premoli,et al.  Piecewise-linear programming: The compact (CPLP) algorithm , 1986, Math. Program..

[178]  R. Tibrewala,et al.  Optimal Scheduiing of Two Consecutive Idle Periods , 1972 .

[179]  Fred Glover,et al.  Network Application in Industry and Government , 1977 .

[180]  Gerald L. Thompson,et al.  A forward algorithm and planning horizon procedure for the production smoothing problem without inventory , 1984 .

[181]  Edward Minieka,et al.  Maximal, Lexicographic, and Dynamic Network Flows , 1973, Oper. Res..

[182]  T. A. Lambe,et al.  ASSIGNMENT OF TRAFFIC TO A NETWORK OF SIGNALIZED CITY STREETS , 1980 .

[183]  James B. Orlin,et al.  Maximum-throughput dynamic network flows , 1983, Math. Program..

[184]  Fred Glover,et al.  An Integrated Production, Distribution, and Inventory Planning System , 1979 .

[185]  Suresh P. Sethi,et al.  Decision and Forecast Horizons in a Stochastic Environment: A Survey , 1987 .

[186]  John M. Mulvey,et al.  Vectorization and multitasking of nonlinear network programming algorithms , 1988, Math. Program..

[187]  John M. Mulvey,et al.  Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP , 1986, Oper. Res..

[188]  Anna Nagurney,et al.  Sensitivity analysis for the asymmetric network equilibrium problem , 1984, Math. Program..

[189]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[190]  F. Glover,et al.  The Passenger-Mix Problem in the Scheduled Airlines , 1982 .

[191]  Geoffrey N. Berlin,et al.  The use of directed routes for assessing escape potential , 1978 .

[192]  Edward Minieka,et al.  Dynamic network flows with arc changes , 1974, Networks.

[193]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[194]  Darwin Klingman,et al.  A Multi-Period Production, Distribution, and Inventory Planning Model, , 1979 .

[195]  J. Aronson,et al.  A forward network simplex algorithm for solving multiperiod network flow problems , 1986 .

[196]  C. L. Monma,et al.  A primal algorithm for finding minimum-cost flows in capacitated networks with applications , 1982, The Bell System Technical Journal.

[197]  Jonathan Halpern,et al.  Shortest path with time constraints on movement and parking , 1974, Networks.

[198]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[199]  A. Frieze.  Complexity of a 3-dimensional assignment problem , 1983 .

[200]  Gerald L. Thompson,et al.  Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems , 1972, JACM.

[201]  F. Glover,et al.  Basis exchange characterizations for the simplex son algorithm for LP/embedded networks , 1985 .

[202]  James R. Evans.  Technical Note - A Single-Commodity Transformation for Certain Multicommodity Networks , 1978, Oper. Res..

[203]  Rolf A. Lundin,et al.  Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results , 1975, Oper. Res..

[204]  James B. Orlin,et al.  Minimum Convex Cost Dynamic Network Flows , 1984, Math. Oper. Res..

[205]  Darwin Klingman,et al.  Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code , 1976, Oper. Res..

[206]  Yu. M. Ermol'ev,et al.  Planning of shipping empty seaborne containers , 1976 .

[207]  Robert E. Bixby,et al.  Converting Linear Programs to Network Problems , 1980, Math. Oper. Res..

[208]  Thomas E. Ramsay,et al.  Heuristics for Multistage Production Planning Problems , 1983 .

[209]  Cheryl Gaimon,et al.  Optimal inventory, backlogging and machine loading in a serial, multi-stage, multi-period production environment , 1986 .

[210]  E. H. Bowman.  Production Scheduling by the Transportation Method of Linear Programming , 1956 .

[211]  Roy L. Crum,et al.  Implementation of Large-Scale Financial Planning Models: Solution Efficient Transformations , 1979 .

[212]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[213]  Darwin Klingman,et al.  OR Practice - A Logistics Planning System at W. R. Grace , 1988, Oper. Res..

[214]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[215]  M. Venkataramanan,et al.  Network reoptimization procedures for multiobjective network probelems , 1989 .

[216]  S A Zenios.  SEQUENTIAL AND PARALLEL ALGORITHMS FOR CONVEX GENERALIZED NETWORK PROBLEMS AND RELATED APPLICATIONS , 1986 .

[217]  Egon Balas,et al.  An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..

[218]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[219]  S. Dafermos.  Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem , 1982 .

[220]  Richard E. Rosenthal,et al.  A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System , 1981, Oper. Res..

[221]  Darwin Klingman,et al.  Improved Computer-Based Planning Techniques. Part II , 1979 .

[222]  Stavros A. Zenios,et al.  Nonlinear network optimization on a massively parallel connection machine , 1988 .

[223]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[224]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[225]  W. L. Wilkinson,et al.  An Algorithm for Universal Maximal Dynamic Flows in a Network , 1971, Oper. Res..

[226]  E. J. Anderson,et al.  Basic solutions and a ‘simplex’ method for a class of continuous linear programs , 1980 .

[227]  Gerald M. Masson,et al.  Generalized multi-stage connection networks , 1972, Networks.

[228]  William W. White,et al.  Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers , 1972, Networks.

[229]  J. C. Bean,et al.  A Dynamic Infinite Horizon Replacement Economy Decision Model , 1984 .

[230]  W. Zangwill.  From EOQ Towards ZI , 1987 .

[231]  L. Escudero.  On nonlinear replicated networks , 1985 .

[232]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[234]  Suresh Chand,et al.  A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem , 1982 .

[235]  Jean-Marc Rousseau,et al.  A Tactical Planning Model for Rail Freight Transportation , 1984, Transp. Sci..

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

[237]  A. I. Propoi,et al.  The Dynamic Simplex-Method , 1977 .

[238]  Fred Glover,et al.  Improved Computer-Based Planning Techniques, Part 1 , 1978 .

[239]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[240]  Robert H. Clark,et al.  Multiprocessor algorithms for generalized network flows , 1987 .

[241]  Fred Glover,et al.  Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems , 1973 .

[242]  Paul H. Zipkin.  Bounds for aggregating nodes in network problems , 1980, Math. Program..

[243]  G. L. Thompson,et al.  A survey on forward methods in mathematical programming , 1984 .

[244]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[245]  Anna Nagurney,et al.  A general dynamic spatial price equilibrium model: formulation, solution, and computational results , 1988 .

[246]  George B. Dantzig,et al.  Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[247]  John M. Mulvey,et al.  Solving Large Scale Generalized Networks , 1985 .

[248]  Jeffery L. Kennington,et al.  Multicommodity Network Problems: Applications and Computations , 1984 .

[249]  Pierre N. Robillard,et al.  Multipath traffic assignment with dynamic input flows , 1974 .

[250]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[251]  Darwin Klingman,et al.  An operational approach to integrated working capital planning , 1983 .

[252]  Wlodzimierz Szwarc,et al.  A Transportation Type Aggregate Production Model with Backordering , 1983 .

[253]  Norman Zadeh,et al.  On building minimum cost communication networks , 1973, Networks.

[254]  R. Rosenthal.  Representing inverses in pure network flow optimization , 1986 .

[255]  Richard V. Helgason,et al.  An Efficient Procedure for Implementing a Dual Simplex Network Flow Algorithm , 1977 .

[256]  Alan M. Frieze,et al.  A bilinear programming formulation of the 3-dimensional assignment problem , 1974, Math. Program..

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

[258]  Suresh Chand,et al.  Minimal forecast horizon procedures for dynamic lot size models , 1986 .

[259]  James R. Evans.  The multicommodity assignment problem: a network aggregation heuristic , 1981 .

[260]  D. Gazis,et al.  Optimal Control of Oversaturated Store-and-Forward Transportation Networks , 1976 .

[261]  Darwin Klingman,et al.  The Successful Deployment of Management Science Throughout Citgo Petroleum Corporation , 1987 .

[262]  Darwin Klingman,et al.  Modeling and Solving Network Problems , 1978 .

[263]  Abraham Charnes,et al.  Past, Present and Future of Development, Computational Efficiency, and Practical Use of Large Scale Transportation and Transhipment Computer Codes , 1973 .

[264]  Arthur F. Veinott,et al.  Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[265]  Fred Glover,et al.  A Netform System for Resource Planning in the U.S. Bureau of Land Management , 1984 .

[266]  Alan Frieze,et al.  An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice , 1981 .

[267]  R. L. Smith.  Deferral strategies for a dynamic communications network , 1979, Networks.

[268]  Kenneth S. Nickerson,et al.  Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations , 1988 .

[269]  W. Zangwill.  A Deterministic Multi-Period Production Scheduling Model with Backlogging , 1966 .

[270]  Gerald G. Brown,et al.  Automatic identification of embedded network rows in large-scale optimization models , 1984, Math. Program..

[271]  Anna Nagurney,et al.  A general dynamic spatial price network equilibrium model with gains and losses , 1989, Networks.

[272]  S. Zenios,et al.  Real-time operational planning for the U. S. air traffic system , 1987 .

[273]  Edward J. Anderson,et al.  Duality and an Algorithm for a Class of Continuous Transportation Problems , 1984, Math. Oper. Res..

[274]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[275]  Gerald L. Thompson,et al.  A problem expanding parametric programming method for solving the job shop scheduling problem , 1985 .

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

[277]  H. D. Ratliff,et al.  Note—Some Equivalent Objectives for Dynamic Network Flow Problems , 1982 .

[278]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[279]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[280]  Frederic H. Murphy,et al.  End effects in capacity expansion models with finite horizons , 1986 .

[281]  Arjang A. Assad,et al.  Analytical Models In Rail Transportation: An Annotated Bibliography , 1981 .

[282]  Darwin Klingman,et al.  A Cotton Ginning Problem , 1976, Oper. Res..

[283]  Horst W. Hamacher,et al.  On the use of lexicographic min cost flows in evacuation modeling. , 1987 .

[284]  F. Glover,et al.  The Generalized Alternating Path Algorithm for Transportation Problems. , 1978 .

[285]  S. Dafermos.  The Traffic Assignment Problem for Multiclass-User Transportation Networks , 1972 .

[286]  Fred Glover,et al.  Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .