Reference health
A survey of dynamic network flows
234/234 checkable references clean · checked 2026-09-03
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
161 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 234 checked references that resolve
resolves10.1002/net.3230080405
Primal simplex network codes: State‐of‐the‐art implementation technology
resolves10.1287/opre.28.4.995
Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
resolves10.1287/moor.9.2.222
Duality and an Algorithm for a Class of Continuous Transportation Problems
resolves10.1016/0377-2217(86)90302-4
The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
resolves10.1002/nav.3800330310
A forward network simplex algorithm for solving multiperiod network flow problems
resolves10.1016/0305-0548(89)90009-9
A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems
resolves10.1016/0377-2217(84)90104-8
A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
resolves10.1287/mnsc.20.12.1561
Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
resolves10.1007/BF02592024
A variation on Karmarkar’s algorithm for solving linear programming problems
resolves10.1007/BF01585504
An improved version of the out-of-kilter method and a comparative study of computer codes
resolves10.1016/0377-2217(78)90110-8
The generalized alternating path algorithm for transportation problems
resolves10.1007/BF01586087
A unified framework for primal-dual methods in minimum cost network flow problems
resolves10.1016/S1474-6670(17)55135-6
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
resolves10.1287/opre.36.1.93
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
resolves10.1016/0305-0548(82)90024-7
The air traffic flow control problem as an application of network theory
resolves10.1287/mnsc.34.3.342
Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
resolves10.1287/opre.4.1.100
Production Scheduling by the Transportation Method of Linear Programming
resolves10.1287/mnsc.24.1.1
Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
resolves10.1007/BF02591728
Automatic identification of embedded network rows in large-scale optimization models
resolves10.1016/0377-2217(88)90429-8
Congested network flows: Time-varying demands and start-time policies
resolves10.1287/mnsc.28.6.652
A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem
resolves10.1002/nav.3800290310
Planning horizon procedures for machine replacement models with several possible replacement alternatives
resolves10.1287/mnsc.15.8.B365
Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
resolves10.1016/0305-0548(75)90010-6
Past, present and future of large scale transshipment computer codes and applications
resolves10.1016/0377-2217(88)90382-7
Modeling of building evacuation problems by network flows with side constraints
resolves10.1016/0022-247X(66)90009-6
The shortest route through a network with time-dependent internodal transit times
resolves10.2307/2330659
Implementation of Large-Scale Financial Planning Models: Solution Efficient Transformations
resolves10.1287/trsc.5.4.366
An Extended Traffic Assignment Model with Applications to Two-Way Traffic
resolves10.1287/trsc.6.1.73
The Traffic Assignment Problem for Multiclass-User Transportation Networks
resolves10.1287/trsc.16.2.231
Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem
resolves10.1002/net.3230120105
The general multimodal network equilibrium problem with elastic demand
resolves10.1287/opre.32.5.1069
Sensitivity Analysis for the General Spatial Economic Equilibrium Problem
resolves10.1287/trsc.10.1.1
Optimal Control of Oversaturated Store-and-Forward Transportation Networks
resolves10.1287/trsc.21.4.227
Survey Paper—A Review of Empty Flows and Fleet Management Models in Freight Transportation
resolves10.1016/0377-2217(86)90300-0
Performance evaluation of independent superbasic sets on nonlinear replicated networks
resolves10.1287/opre.26.4.673
Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
resolves10.1016/0898-1221(81)90118-8
The multicommodity assignment problem: a network aggregation heuristic
resolves10.1287/mnsc.32.3.341
Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
resolves10.1287/mnsc.32.9.1140
The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
resolves10.1007/BF01582246
A simplex algorithm for piecewise-linear programming I: Derivation and proof
resolves10.1007/BF01580769
A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy
resolves10.1007/BF01585532
A bilinear programming formulation of the 3-dimensional assignment problem
resolves10.1057/jors.1981.207
An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
resolves10.1080/00207548608919757
Optimal inventory, backlogging and machine loading in a serial, multi-stage, multi-period production environment
resolves10.1007/BF02591685
A variant of Karmarkar's linear programming algorithm for problems in standard form
resolves10.1007/BF02592025
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
resolves10.1016/0191-2615(85)90016-5
Large-scale network distribution of pooled empty freight cars over time, with limited substitution and equitable benefits
resolves10.1057/jors.1984.124
A Netform System for Resource Planning in the U.S. Bureau of Land Management
resolves10.1002/net.3230040302
Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problems
resolves10.1287/mnsc.20.5.783
A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
resolves10.1007/BFb0121048
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
resolves10.1007/BF01580728
Layering strategies for creating exploitable structure in linear and integer programs
resolves10.1287/trsc.7.4.377
Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems
resolves10.1002/net.3230140308
Optimal dynamic routing in communication networks with continuous traffic
resolves10.1287/opre.10.4.448
New Methods in Mathematical Programming—The Solid Transportation Problem
resolves10.1002/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9
On the use of lexicographic min cost flows in evacuation modeling
resolves10.1080/05695557708975122
An Efficient Procedure for Implementing a Dual Simplex Network Flow Algorithm
resolves10.1007/BF02591904
Computational experience with advanced implementation of decomposition algorithms for linear programming
resolves10.1287/opre.24.6.1056
Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
resolves10.1016/S0041-1647(69)80022-5
The minimum route problem for networks with turn penalties and prohibitions
resolves10.1287/mnsc.20.5.814
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
resolves10.1287/mnsc.33.7.813
An Optimization Based Integrated Short-Term Refined Petroleum Product Planning System
resolves10.1287/inte.17.1.4
The Successful Deployment of Management Science Throughout Citgo Petroleum Corporation
resolves10.1007/BF01580763
Minimum concave cost production system: A further generalization of multi-echelon model
resolves10.1287/opre.23.4.711
Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
resolves10.1002/1520-6750(198808)35:4<493::AID-NAV3220350405>3.0.CO;2-0
Multiperiod allocation of limited resources: A minimax approach
resolves10.1080/05695558108974531
Dynamic Network Flow Modelling of Fixed Path Material Handling Systems
resolves10.1002/net.3230070102
A generalized upper bounding approach to a communications network planning problem
resolves10.1016/0167-6377(90)90026-2
Solution of large dense transportation problems using a parallel primal algorithm
resolves10.1287/mnsc.25.12.1232
Using Linear Programming to Derive Planning Horizons for a Production Smoothing Problem
resolves10.1002/j.1538-7305.1982.tb04325.x
A Primal Algorithm for Finding Minimum-Cost Flows in Capacitated Networks With Applications
resolves10.1287/opre.15.3.542
Letter to the Editor—On the Necessary Conditions for the Existence of the Solution of the Multi-Index Transportation Problem
resolves10.1287/opre.26.6.1046
Universal Planning Horizons for Generalized Convex Production Scheduling
resolves10.1177/109434208900300104
Parallel and Serial Variational Inequality Decomposition Algorithms for Multicommodity Market Equilibrium Problems
resolves10.1016/0377-0427(88)90412-8
A general dynamic spatial price equilibrium model: formulation, solution, and computational results
resolves10.1002/net.3230190703
A general dynamic spatial price network equilibrium model with gains and losses
resolves10.1016/0191-2615(87)90005-1
An operational planning model for the dynamic vehicle allocation problem with uncertain demands
resolves10.1287/opre.37.1.12
OR Practice—Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry
resolves10.1287/inte.18.1.21
Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations
resolves10.1287/opre.29.4.763
A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
resolves10.1016/0305-0548(86)90059-6
Solution of constrained generalized transportation problems using the pivot and probe algorithm
resolves10.1145/321724.321734
Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
resolves10.1145/321752.321754
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
resolves10.1007/BF02022046
A problem expanding parametric programming method for solving the job shop scheduling problem
resolves10.1007/BF02592017
Relaxation methods for problems with strictly convex separable costs and linear constraints
resolves10.1287/opre.17.2.262
Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
resolves10.1002/net.3230020304
Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
resolves10.1287/mnsc.30.3.308
Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems
resolves10.1287/mnsc.13.1.105
A Deterministic Multi-Period Production Scheduling Model with Backlogging
resolves10.1287/mnsc.15.9.506
A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
resolves10.1109/TCS.1983.1085365
A Dynamic Marketing Network with Monopsonistic Acquisition and Perfectly Competitive Disposition
resolves10.1093/imamat/31.1.51
A Dynamic Marketing, Storage and Transportation System with Perfect Competition in Each of Its Markets
resolves10.1287/ijoc.1.1.20
Parallel Numerical Optimization: Current Status and an Annotated Bibliography
resolves10.1287/opre.34.5.667
Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
resolves10.1007/BF01589416
Vectorization and multitasking of nonlinear network programming algorithms
The 161 references without a DOI — listed, not checked
no DOI — not checkedAderohunmu, R.S., The solution of multiperiod network models with bundle constraints by aggregation, Doctoral Dissertation, Department of Operations Research and Engineering Management, School of Engineering and Applied Sciences, Southern Methodist University, Dallas, TX (August, 1986).
no DOI — not checkedAderohunmu, R.S. and J.E. Aronson, Computational results of problems applying aggregation of multiperiod network models for production planning, presented at the Joint National TIMS/ORSA Meeting, Atlanta, GA (November 1985).
no DOI — not checkedAderohunmu, R.S and J.E. Aronson, The solution of multiperiod network models with bundle constraints by aggregation, Working Paper No. 87-244, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA (December 1987).
no DOI — not checkedAderohunmu, R.S. and J.E. Aronson, A forward network-based implementation of an algorithm for solving multiperiod network problems (with bundle constraints by aggregation), Working Paper (forthcoming), College of Business Adminstration, The University of Georgia, Athens, GA, presented at TIMS/ORSA Washington, DC (April 1988).
no DOI — not checkedAdolphson, D. and J.E. Aronson, A forward generalized network algorithm, Private Communication of Research in Progress, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA (1988).
no DOI — not checkedAllen, E.P., Using two sequences of pure network problems to solve the multicommodity network flow problem, Doctoral Dissertation, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX (May 1985).
no DOI — not checkedARC: Analysis Research and Computation, Inc., PNET User's Guide, Austin, TX 78765 (1974).
no DOI — not checkedAnderson, E.J., Basic solutions and a ‘simplex’ method for a class of continuous linear programs, in:Optimization Techniques, Proc. 9th IFIP Conf. on Optimization Techniques, Warsaw, Poland (Springer-Verlag, Berlin, 1979), pp. 26–35.
no DOI — not checkedAronson, J.E., Forward linear programming, Doctoral Dissertation, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (April 1980a).
no DOI — not checkedAronson, J.E., The forward simplex method: Computational results, Working Paper No. 62-79-80, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburg, PA (April 1980b).
no DOI — not checkedAronson, J.E., Networks tutorial, in:Proc. 1988 Annual Meeting of the Decision Sciences Institute, Las Vegas, NV (November 1988).
no DOI — not checkedAronson, J.E. and J.S. Aronofsky, Network generating models for equipment replacement with changing technology, Research in Progress, presented at the Joint National ORSA/TIMS Meeting, Dallas, TX (November 1984).
no DOI — not checkedAronson, J.E. and J.S. Aronofsky, The integration of model generation and network optimization in a decision support environment, Technical Report 83-OR-5, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX (revised April 1987).
no DOI — not checkedAronson, J.E., R.S. Barr , R.V. Helgason, J.L. Kennington, A. Loh and H. Zaki, The projective transformation algorithm by Karmarkar: A computational experiment with assignment problems, Technical Report 85-OR-3, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas TX (revised August 1985), presented at the TIMS XXVII International Meeting, Gold Coast City, Queensland, Australia (July 1986).
no DOI — not checkedAronson, J.E. and B.D. Chen, Decision horizon results for an infinite horizon, production planning network model, Technical Report 85-OR-11, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX (September 1985).
no DOI — not checkedAronson, J.E. and B.D. Chen, A computational study of empirical decision horizons in infinite horizon, multiperiod network flow models, Working Paper No. 89-275, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA (revised January 1989b).
no DOI — not checkedAronson, J.E. and R.E. Steuer, An interactive procedure for solving multicriteria network flow problems, Working Paper in preparation, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA, presented at the CORS/TIMS/ORSA Joint National Meeting, Vancouver, BC, Canada (May 1989).
no DOI — not checkedAronson, J.E. and G.L. Thompson, A survey on forward methods in mathematical programming, Large Scale Systems 7(1984)1–16.
no DOI — not checkedAronson, J.E. and G.L. Thompson, The solution of multiperiod personnel planning problems by the forward simplex method, Large Scale Systems 9(1985)129–139.
no DOI — not checkedAssad, A.A., Analytical models in rail transportation: An annotated bibliography, INFOR 19, 1(1981)59–80.
no DOI — not checkedBaker, L., Overview of computer based models applicable to freight container utilization, Report prepared for U.S. Department of Transportation, NITS, Springfield, VA (1977).
no DOI — not checkedBarr, R.S., Network optimization on microcomputers, Department of Operations Research and and Engineering Management, Southern Methodist University, Dallas TX. Presented at the ORSA/TIMS Joint National Meeting, Boston, MA (April 1985).
no DOI — not checkedBarr, R.S., J.J. Elam, F. Glover and D. Klingman, A network alternating path basis algorithm for transshipment problems, in:Extremal Methods and Systems Analysis (Springer-Verlag, NY, 1980).
no DOI — not checkedBarr, R.S., K. Farhangian and J.L. Kennington, Networks with side constraints: An LU factorization update. Ann. Soc. Logistics Engineers 1, 1(1986)68–85.
no DOI — not checkedBarr, R.S., F. Glover and D. Klingman, Enhancements to spanning tree labeling procedures for network optimization, INFOR 17, 1(1979)16–33.
no DOI — not checkedBeckman, M.J., On the theory of traffic flows in networks, Traffic Quarterly 21(1967)109–116.
no DOI — not checkedBerlin, G.N., The use of directed routes for assessing escape potential, National Fire Protection Association, Boston, MA (1979).
no DOI — not checkedBertsekas, D.P. and J.N. Tsitsiklis,Parallel and Distributed Algorithms (Prentice-Hall, Englewood Cliffs NJ, 1988).
no DOI — not checkedBhaskaran, S., S. Chand and S.P. Sethi, Decision and forecast horizon procedures in operations management, Private Communication of Research in Progress (1986).
no DOI — not checkedBhaumik, G., Optimum operating policies of a water distribution system with losses Unpublished Dissertation, The University of Texas at Austin, Austin, TX (August 1973).
no DOI — not checkedCarey, M., A convex dynamic assignment model, Working Paper, School of Urban and Public Affairs, Carnegie-Mellon University, Pittsburth, PA (1980).
no DOI — not checkedCarey, M., An approach to modeling dynamic network flows on congested networks, Working Paper, School of Urban and Public Affairs, Carnegie-Mellon University, Pittsburgh, PA (1988).
no DOI — not checkedCarey, M. and A. Srinivasan, Modeling network flows with time-varying demand, Report to the Urban Mass Transportation Administration under Contract No. PA-06-0063, School of Urban and Public Affairs, Carnegie-Mellon University, Pittsburgh, PA (1982).
no DOI — not checkedCarey, M. and A. Srinivasan, Externalities, optimal tolls and flow controls on congested networks with time-varying flows, School of Urban and Public Affairs, Carnegie-Mellon University, Pittsburgh, PA (July 1985).
no DOI — not checkedCharnes, A. and W.W. Cooper,Management Models and Industrial Applications of Linear Programming, Vol. I and II (Wiley, New York, 1961).
no DOI — not checkedChen, B.D., Forward network programming, Doctoral Dissertation, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX (May 1985).
no DOI — not checkedChoi, W., R.L. Francis, H.W. Hamacher and S. Tufekci, Network models of building evacuation problems with flow-dependent exit capacities, Operational Research (Proc. 10th Int. Conf. on Operations Research, Washington, DC, August 1984), ed. J.P. Brans (North-Holland, Amsterdam, 1984) pp. 1047–1059.
no DOI — not checkedChvátal, V.,Linear Programming (Freeman, New York, 1983).
no DOI — not checkedClark, R.H. and R.R. Meyer, Multiprocessor algorithms for generalized network flows, Computer Sciences Technical Report, No. 739, Computer Sciences Department, University of Wisconsin, Madison, WI (1987).
no DOI — not checkedCorban, A., A multidimensional transportation problem, Revue Roumaine des Mathematiques Pures et Appliquees 9(1964)721–735.
no DOI — not checkedCorban, A., On a three-dimensional transportation problem, Revue Roumaine des Mathematiques Pures et Appliquees 11(1966)57–75.
no DOI — not checkedCrum, R.L., Cash management in the multinational firm: A constrained generalized network approach, Working Paper, University of Florida, Gainesville, FL (1976).
no DOI — not checkedCrum, R.L., D.D. Klingman and L.A. Tavis, Strategic management of multinational companies: Network-based planning systems, in:Applications of Management Science, ed. R.L. Shultz, Vol. 3 (JAI Press, Inc., Greenwich, CT, 1983b) pp. 177–201.
no DOI — not checkedCuimet, G.P., Empty freight car distribution, Master's Thesis, Queen's University, Kingston, Ontario, Canada (April 1972).
no DOI — not checkedDafermos, S. and F. Sparrow, The traffic assignment problem for a general network, Journal of Research of the National Bureau of Standards 75B(1969)91–117.
no DOI — not checkedDantzig, G.B., W. Blattner and M.R. Rao, Finding a cycle in a graph with minimum cost to times ratio with application to a ship routing problem, in:Theory of Graphs, ed. P. Rosenthiehl (Dunod, Paris; Gordon and Breach, New York, 1967) pp. 77–84.
no DOI — not checkedDecision Systems Associates, Inc., Implementation studies via simulation of the computer-based model for freight car distribution, Report prepared for U.S. Department of Transportation, FRA, DSAI, Rockville, MD (1978a).
no DOI — not checkedDecision Systems Associates, Inc., Computer-based model for optimal freight car distribution, FRA Contract DPT-FR-65140, U.S. Department of Transportation, DSAI, Rockville, MD (1978b).
no DOI — not checkedDrews, W.P., A simplex-like algorithm for continuous-time linear optimal control problems, in:Optimization Methods for Resource Allocation (Proc. NATO Conf., Elsinore, Denmark) (English University Press, London, 1974), pp. 309–322.
no DOI — not checkedElam, J.J. and D. Klingman, NETGEN-II: A system for generating network-based mathematical programming test problems, in:Evaluating Mathematical Programming Techniques, Lecture Notes in Economics and Mathematical Systems 199, ed. J.M. Mulvey (Springer-Verlag, New York, 1982).
no DOI — not checkedElnidani, M.A., The multicommodity, multiperiod assignment problem, Doctoral Dissertation, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX (May 1986).
no DOI — not checkedElnidani, M.A. and J.E. Aronson, The multicommodity, multiperiod assignment problem I: A specialized branch and bound algorithm, Working Paper 89-276, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA (presented at the TIMS XXVII International Meeting, Gold Coast City, Queensland, Australia, July 1986) (1989a).
no DOI — not checkedElnidani, M.A. and J.E. Aronson, The multicommodity, multiperiod assignment problem II: Theoretical results, Working Paper 89-277, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA (presented at the ORSA/TIMS Joint National Meeting, Denver, CO, October 1988) (1989b).
no DOI — not checkedElnidani, M.A. and J.E. Aronson, The multicommodity, multiperiod assignment problem III: Variations for facility location and personnel planning, Working Paper 89-278, Department of Management Sciences and Information Technology, College of Business Administration, The University of Georgia, Athens, GA (presented at the Joint National ORSA/TIMS Meeting, Los Angeles, CA, April 1986) (1989c).
no DOI — not checkedEscudero, L.F., On nonlinear replicated networks, Questiio 9(1985)55–74.
no DOI — not checkedFarina, R. and F. Glover, Optimal development and allocation of Colorado's energy resources over the coming decade, in:Energy Issues in Colorado's Future (Colorado Energy Research Institute, 1980) pp. 161–199.
no DOI — not checkedFarvolden, J.M., A primal partitioning solution for capacitated multicommodity network flow problems. Doctoral Dissertation, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ (1989).
no DOI — not checkedFeeney, G., Controlling the distribution of empty freight cars, in:Proc. 10th National Meeting (Operations Research Society of America, 1957).
no DOI — not checkedFernandes Grain, M.T. and M.C. Fogliatti de Sinay, Optimal distribution of empty railroad cars, in:Proc. 1st Int. Congress in France of Industrial Engineering and Management, Ecole Centrale de Paris, Paris, France (1986) pp. 21–26.
no DOI — not checkedFlorez, H., Empty-container repositioning and leasing: An optimization model, Doctoral Dissertation, Polytechnic Institute of New York, New York, NY (1986).
no DOI — not checkedFord, Jr., L.R. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962).
no DOI — not checkedFourer, R., A simplex algorithm for piecewise-linear programming III: Computational analysis and applications, Technical Report 86-03, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (1986).
no DOI — not checkedFrantzeskasis, L.F. and W.B. Powell, Development and evaluation of a successive linear approximation procedure for stochastic dynamic networks, Report SOR-88-13, Deparment of Civil Engineering and Operations Research, Princeton University, Princeton, NJ (1988).
no DOI — not checkedGarfinkel, R.S. and G.L. Nemhauser,Integer Programming (Wiley, New York, 1972).
no DOI — not checkedGass, S.I.,Linear Programming: Methods and Applications, 4th ed. (McGraw-Hill, New York, 1975).
no DOI — not checkedGlover, F., D. Karney and D. Klingman, Double-pricing dual and feasible start algorithms for the capacitated transportation (distribution) problem, CCS Research Report 105, Center for Cybernetic Studies, The University of Texas at Austin, Austin, TX (1973).
no DOI — not checkedGlover, F. and D. Klingman, New advances in the solution of large-scale network and network-related problems, in:Colloquia Mathematica Societatis, ed. A. Prekopa, (North-Holland, Amsterdam, 1975a) pp. 210–223.
no DOI — not checkedGlover, F., and D. Klingman, Improved labeling of L.P. bases in networks, Omega, 23, 2(1975b)220–221.
no DOI — not checkedGlover, F. and D. Klingman, A practitioner's guide to the state of large-scale network and network-related problems,AFIPS-Conference Proceedings, Vol. 45, Montvale, NJ (1976), pp. 945–950.
no DOI — not checkedGlover, F. and D. Klingman, Modeling and solving network problems, in:Design and Implementation of Optimization Software, ed. H. Greenberg (Sijthoff and Noordhoff, Alphen aan den Rijn, 1978).
no DOI — not checkedGlover, F. and D. Klingman, Mathematical optimization — a successful tool for logistics problems, in:Operation Research '81, ed. J.P. Brans (IFORS — North-Holland, Amsterdam, 1981a) pp. 453–462.
no DOI — not checkedGlover, F., D. Klingman and J. Stutz, Augmented threaded index method, INFOR 12, 3(1974) 293–298.
no DOI — not checkedGlover, F. and F. Martinson, Linear programming/netform model for vegetation allocation, in:Ecological Modeling (Elsevier, Amsterdam, 1982).
no DOI — not checkedGlover, F., C. McMillan and P. Taylor, A computer-based decision support system for air terminal overload management,Proc. 10th Annual International Conference on Systems Sciences, Honolulu, HI (1977).
no DOI — not checkedGorenstein, S., S. Poley and W. W. White, On the scheduling of the railroad freight operations, IBM Data Processing Report, Technical Report 320-2999, IBM, Philadelphia Scientific Center, Philadelphia, PA (1971).
no DOI — not checkedGotlieb, C.C., The construction of class-teacher timetables,Proc. IFIP Congress (1962) pp. 73–77.
no DOI — not checkedGunawardane, G., A three-dimensional assignment problem, presented at the ORSA/TIMS Joint National meeting, San Diego, CA (October 1982).
no DOI — not checkedGurel, M. and D.M. Winbigler, Container provisioning for an airline network, presented at the 32nd National Meeting, ORSA, Chicago, IL (November 1967).
no DOI — not checkedHaghani, A.E., A combined model of train routing, makeup and empty distribution, Doctoral Dissertation, Northwestern University, Evanston, IL (1986).
no DOI — not checkedHaghani, A.E., and M.S. Daskin, A combined model of train routing, makeup and empty car distribution. Technical Report, Northwestern University, Evanston, IL (1986).
no DOI — not checkedHalpern, J. and R.A.M. Outerbridge, PFLOW: A computer program for the generalized P-period maximal dynamic flows problem, Working paper WP-11-77, Faculty of Business, University of Calgary, Alberta, Canada (August 1977).
no DOI — not checkedHartman, D., User's Manual: The interactive DYNAFLO program, A-level, Working Paper No. 6, Manufacturing Flow Research Project, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI (December 1978).
no DOI — not checkedHein, O., Naherungsverfahren für das ‘Überschuss-Bedarf’ Problem, Angewandte Informatik 17 (1975)324–326.
no DOI — not checkedHein, O., Naherungsverfahren für die Leerwagenverteilung, Eisenbahntechnische Rundschau 27 (1978)73–77.
no DOI — not checkedHelgason, R.V. and J.L. Kennington, NETFLO program documentation, Technical Report IEOR 76011, Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas, TX (September 1976).
no DOI — not checkedHelgason, R.V., J.L. Kennington and P. Wong, An application of network programming for National Forest Planning, Technical Report, 81006, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, TX, (February, 1982).
no DOI — not checkedHerren, H., The distribution of empty wagons by means of computer: Analytical model of the Swiss Federal Railways, Rail Int. 4(1973)1005–1010.
no DOI — not checkedHerren, H., Computer-controlled empty wagon distribution on the SBB, Rail Int. 8(1977)25–32.
no DOI — not checkedHillier, F.S. and G.J. Lieberman,Introduction to Operations Research, 4th ed. (Holden-Day, San Francisco, CA, 1987).
no DOI — not checkedHultz, J., Algorithms and applications for generalized networks, Unpublished Dissertation The University of Texas at Austin, Austin, TX (1976).
no DOI — not checkedIBM: International Business Machines Corporation, IBM Mathematical Programming System Extended/370, Mixed Integer Programming/370 (MIP/370) Program Reference Manual, White Plains, NY (November 1975).
no DOI — not checkedIBM: International Business Machines Corporation, IBM Mathematical Programming System Extended/370 Program Reference Manual, White Plains, NY (December 1979).
no DOI — not checkedJensen, P. and J.W. Barnes,Network Flow Programming (Wiley, New York, 1980).
no DOI — not checkedJohnson, E., Flows in networks, in:Handbook of Operations Research, ed. S. J. Moder and S.E. Elmaghraby, (van Nostrand Rheinhold, New York, 1979) pp 183–206.
no DOI — not checkedJordan, W.C., The impact of uncertain demand and supply on empty rail car distribution, Doctoral Dissertation, Cornell University, Ithaca, NY (1982).
no DOI — not checkedKang, M.K., Dynamic network flow models of conveyor systems, Working Paper, No. 5, Manufacturing Flow Research Project, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI (March 1978).
no DOI — not checkedKennington, J.L. and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1980).
no DOI — not checkedKennington, J.L. and R. Muthukrishnan, An asynchronous algorithm to solve generalized network problems, presented at the ORSA/TIMS Joint National Meeting, Denver, CO (November 1988).
no DOI — not checkedKim, Y., An optimal computational approach to the analysis of a generalized network of copper refining process, presented at the Joint National ORSA/TIMS/AIIE Conference, Atlantic City, NJ (1972).
no DOI — not checkedKlein, R.S., H. Luss and D.R. Smith, Multiperiod resource allocation: A lexicographic minimax approach, presented at the ORSA/TIMS Joint National Meeting, St. Louis, MO (1987).
no DOI — not checkedKlingman, D. and J. Mote, A multi-period production, distribution, and inventory planning model, Advances in Management Studies 1, 2(1982)56–76.
no DOI — not checkedKornhauser, A.L., A very large transportation network interactive computer graphic information system and problem solver, Working Paper, Department of Civil Engineering, Transportation Program, Princeton University, Princeton, NJ, presented at the TIMS/ORSA Joint National Meeting, Boston, MA (May 1985).
no DOI — not checkedKornhauser, A.L., Modeling for optimal real time railroad plant management, presented at the CORS/ORSA/TIMS Joint National Meeting, Vancouver, BC, Canada (May 1989).
no DOI — not checkedKornhauser, A.L. and E.A. Adamidou, User and system optimal formulation and solution to the shared rail fleet management problem, presented at the TIMS/ORSA Joint National Meeting, Miami, FL (1986).
no DOI — not checkedLangley, R., Continuous and integer generalized flow problems, Unpublished Dissertation, Georgia Institute of Technology, Atlanta, GA (1973).
no DOI — not checkedLawler, E.L.,Combinatorial Optimization, Networks and Matroids, (Holt, Rinehart and Winston, New York, 1976).
no DOI — not checkedLeue, O., Methoden zur Lösung dreidimensionaler Zuordnungsprobleme, Angewandte Informatik (April 1972) 154–162.
no DOI — not checkedLevin, A., Some fleet routing and scheduling problems for air transportation systems, Report FTL-R68-5, Massachusetts Institute of Technology, Cambridge, MA (1969).
no DOI — not checkedMcBride, R.D., D.E. O'Leary and G.R. Widmeyer, A system for supporting cash management decisions, Working Paper, Graduate School of Business Administration, University of Southern California, Los Angeles, CA (1988).
no DOI — not checkedMendiratta, V.B., A dynamic optimization model of the empty car distribution process, Doctoral Dissertation, Department of Civil Engineering, Northwestern University, Evanston, IL (1981).
no DOI — not checkedMendiratta, V.B. and M.A. Turnquist, A model for the management of empty freight cars, Transportation Research Rec. 838(1982)50–55.
no DOI — not checkedMerchant, D.K., A study of dynamic traffic assignment and control, Doctoral Dissertation, Cornell University, Ithaca, NY (1974).
no DOI — not checkedMerchant, D.K. and G.L. Nemhauser, Optimality conditions for a dynamic traffic assignment model, Transportation Science 12, 3(1978b)201–207.
no DOI — not checkedMeyer, R.R., Parallel algorithms for large-scale nonlinear networks, presented at the SIAM Conference on Optimization, Houston, TX (May 1987).
no DOI — not checkedMeyer, R.R. and S.A. Zenios, eds.,Parallel Optimization on Novel Computer Architectures, Ann. Oper. Res. 14 (1988) (J.C. Baltzer, Basel, 1988).
no DOI — not checkedMorton, T.E., Forward algorithms for forward thinking managers, in:Applications of Management Science, ed. R.L. Schultz, Vol. 1 (JAI Press, Inc., 1981).
no DOI — not checkedMulvey, J.M. A network portfolio approach for cash flow management, J. Cash Management (1984a) 46–48.
no DOI — not checkedMulvey, J.M., A network planning model for the U.S. Air Traffic System, Working Paper EES-83-8, Department of Civil Engineering, Princeton University, Princeton, NJ (1984b).
no DOI — not checkedMurtagh, B. and M. Saunders, MINOS User's Guide, Technical Report 77-9, Stanford Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA (February 1977).
no DOI — not checkedMurtagh, B. and M. Saunders, MINOS/Augmented User's Manual, Technical Report SOL 80-14, Stanford Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA (June 1980).
no DOI — not checkedNguyen, Q.C. and R.E. Stone, A multiperiod resouree allocation problem with storable and substitutable resources, presented at the ORSA/TIMS Joint National Meeting, St. Louis, MO (1987).
no DOI — not checkedOblak, M. and R.R. Vemuganti, The multiperiod assignment problem with changeover constraints, Working Paper, Merrick School of Business, University of Baltimore, Baltimore, MD, presented at the CORS/TIMS/ORSA Joint National Meeting, Vancouver, BC, Canada (May 1989).
no DOI — not checkedOrlin, J.B., Quick optimal weekly scheduling with two consecutive days off, Technical Report 77-1 Department of Operations Research, Stanford University, Stanford, CA (1977).
no DOI — not checkedOuimet, G.P., Empty freight car distribution, Masters Thesis, Queen's University, Kingston, Ontario, Canada (1972).
no DOI — not checkedPerevezentsev, E.N., Scheduling of containers shipments, in:Proc. Central Scientific-Research Institute of the Maritime Fleet, No. 195 (Transport, Leningrad, USSR, 1974), in Russian.
no DOI — not checkedPerold, A.F., Continuous linear programming, Doctoral Dissertation, Department of Operations Research, Stanford University, Stanford, CA (1978).
no DOI — not checkedPhillips, D. and A. Garcia-Diaz,Fundamentals of Network Analysis (Prentice-Hall, New York, 1981).
no DOI — not checkedPhillips, D.T., A. Ravindran and J.J. Solberg,Operations Research, Principles and Practice (Wiley, New York, 1976).
no DOI — not checkedPierskalla, W.P., The tri-substitution method for the three-dimensional assignment problem, CORS Journal 5(1967a)71–81.
no DOI — not checkedPierskalla, W.P., The multi-dimensional assignment and quadratic assignment problems, Technical Memorandum No. 93, Case Western Reserve University, Operations Research Department, School of Management, Cleveland, OH (September 1967b).
no DOI — not checkedPotts, R.B. Movement of empty containers within Australia, presented to the Operations Research Society of Victoria, Melbourne, Australia (September 1970).
no DOI — not checkedPowell, W.B. A comparative review of alternative algorithms for the dynamic vehicle allocation problem, in:Vehicle Routing: Methods and Studies, ed. B. Golden and A.A. Assad (North-Holland, Amsterdam, 1988), pp. 249–291.
no DOI — not checkedPowell, W.B. and D.J. Cape, Sensitivity analysis of dynamic networks: An application to pricing and load evaluation for truckload motor carriers, Report SOR-88-8, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ (1988).
no DOI — not checkedPowell, W.B., Y. Sheffi and S. Thiriez, The dynamic vehicle allocation problem with uncertain demands, in:9th Int. Symp. on Transportation and Traffic Theory, ed. J. Volmuller and R. Hamerslag (VNU Science Press, The Netherlands, 1984).
no DOI — not checkedPropoi, A.I. and V. Krivonozhko, The dynamic simplex method, RM-77-24, International Institute for Applied Systems Analysis, Laxenburg, Austria (1977).
no DOI — not checkedRogers, D.F., R.D. Plante, R.T. Wong and J.R. Evans, Aggregation techniques and methodology in optimization, Working Paper QA-1988-10, Department of Quantitative Analysis and Information Systems, College of Business Administration, University of Cincinnati, Cincinnati, OH (1988).
no DOI — not checkedSandbothe, R.A., Solving the capacitated lot size model, Doctoral Dissertation, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh PA (November 1985).
no DOI — not checkedSchell, E., Distribution of a product by several properties, Directorate of Management Analysis,Proc. 2nd Symp. in Linear Programming ed. H. Antosiewicz, 2, DCS/Comptroller H.Q., U.S. Air Force, Washington, DC, 615–642 (January 1955).
no DOI — not checkedSethi, A.P., Algorithmic enhancements of the simplex method, Doctoral Dissertation, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1983).
no DOI — not checkedSethi, A.P., G.L. Thompson and M.S. Hung, The pivot-and-probe algorithm and XMP, presented at the TIMS/ORSA Joint National Meeting, Washington, DC (April 1988).
no DOI — not checkedShamma, M.M. A generalized assignment problem, Doctoral Dissertation, Computer Science/Operations Research Center, Southern Methodist University, Dallas, TX (March, 1971).
no DOI — not checkedShan, Y., A dynamic multicommodity network flow model for real time optimal rail freight car management, Doctoral Dissertation, Princeton University, Princeton, NJ (1985).
no DOI — not checkedShetty, B., The equal flow problem, Doctoral Dissertation, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas TX (May 1985).
no DOI — not checkedSimmonard, M.,Linear Programming (Prentice-Hall, Englewood Cliffs, NJ, 1966).
no DOI — not checkedStanley, J.D., A forward convex-simplex method with applications, Doctoral Dissertation, Graduate School of Industrial administration, Carnegie-Mellon University, Pittsburgh, PA (April 1984).
no DOI — not checkedStone, R.E., An algorithm for solving network problems with side variables, Working paper, AT & T Bell Laboratories, Holmdel, NJ (Nov. 1988).
no DOI — not checkedThompson, G.L. and R.A. Sandbothe, Bounds for the capacitated lot sized model: A transportation approach, presented at the Joint National ORSA/TIMS Meeting, Atlanta, GA (November 1985).
no DOI — not checkedTruemper, K., How to detect hidden networks and totally-unimodular subsections of linear programs, presented at the TIMS/ORSA Joint National Meeting, Chicago, IL (April 1983).
no DOI — not checkedTseng, P., Relaxation methods for monotropic programming problems, Doctoral Dissertation, Department of Electical Engineering and Computer Science, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA (1986).
no DOI — not checkedTsui, L., DYNAFLO User's Manual, Working paper No. 7, Manufacturing Flow Research Project, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109 (October 1978).
no DOI — not checkedTurnquist, M.A., MOV-EM: A network optimization model for empty freight car distribution, School of Civil and Environmental Engineering, Cornell University, Ithaca, NY (1986).
no DOI — not checkedTurnquist, M.A. and W.C. Jordan, A computer-based method for railroad car distribution, Final Report, DTRS5680-C-00013, U.S. Department of Transportation, Office of University Research (1982).
no DOI — not checkedVajda, S.,Mathematical Programming (Addison-Wesley, Reading, MA, 1961) p. 147.
no DOI — not checkedVlach, M., Branch and bound method for the three index assignment problem, Ekonomicko-Matematicky Obzor (Czechoslovakia) 3(1967)181–191.
no DOI — not checkedWagner, H.M.Principles of Operations Research, 2nd ed. (Prentice-Hall, NJ, 1975).
no DOI — not checkedWagner, H.M.Principles of Operations Research, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1975).
no DOI — not checkedYaged, Jr., B., Economies of scale, networks, and network cost elasticity, IEEE Trans. on Systems, Man, and Cybernetics 5(1975)30–39.
no DOI — not checkedZangwill, W.I., Set-up cost reduction in series facility production, Working paper, University of Chicago, Chicago, IL (January 1985).
no DOI — not checkedZenios, S.A., Sequential and parallel algorithms for convex generalized network problems and related applications, Doctoral Dissertation, Civil Engineering Department, Princeton University, Princeton, NJ (May 1986).
no DOI — not checkedZenios, S.A. and J.M. Mulvey, Simulating a distributed synchronous relaxation method for convex network problems, Working Paper, Department of Civil Engineering, Princeton University, Princeton, NJ (January 1985).
no DOI — not checkedZenios, S.A. and J.M. Mulvey, A distributed algorithm for convex network optimization problems,Parallel Computing 6 (North-Holland, Amsterdam, 1988a) pp. 45–56.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-09-03 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1007/bf02216922"><img src="https://citestamp.com/citestamped/10.1007/bf02216922/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/bf02216922)