A Primal Simplex Specialization for the Equal Flow Problem

REFERENCES

• Ali A. , Kennington , J. , and Shetty , B. , “ The Equal Flow Problem ,” European Journal of Operational Research , 36 , 107 – 115 ( 1988 ).
   Web of Science ®Google Scholar
• Ali , A. , Barnett, D, Farhangian , K. , Kennington , J. , McCarl , B. , Patty , B. , Shetty , B. , and Wong , P. , “ Multicommodity Network Problems Applications and Computations .” The Transactions , Vol. 16 , pp. 127 – 134 , ( 1984 ).
   Google Scholar
• Ali , A. , Allen , E. , Barr., R., and Kennington , J. , “ Reoptimization Procedures for Bounded Variable Primal Simplex Network Algorithms ,” European Journal of Operational Research , 23 , 256 – 263 ( 1986 ).
   Web of Science ®Google Scholar
• Barr , R. , Glover, and Klingman , D. , “ Enhancements of a Spanning Tree Labelling Procedures for Network Optimization ,” INFOR , 17 , 16 – 34 ( 1979 ).
   Web of Science ®Google Scholar
• Barr , R. , Farhangian , K. , and Kennington , J. , “ Networks with Side Constraints An LU Factorization Update ,” The Annals of the Society of Logistics Engineers , 1 , 66 – 85 ( 1986 ).
   Google Scholar
• Beck , P. , Lasdon , L. , and Engquist , M. , “ A Reduced Gradient Algorithm for Nonlinear Network Problems ,” ACM Transactions on Mathematical Software , 9 , 57 – 70 . ( 1983 ).
   Web of Science ®Google Scholar
• Carraresi , P. ,and Gallo , G. , “ Network Models for Vehicle and Crew Scheduling ,” European Journal of Operational Research , 16 , 139 – 151 ( 1984 ).
   Web of Science ®Google Scholar
• Chen , S. , and Saigal , R. , “ A Primal Algorithm for Solving a Capacitated Network Flow Problem with Additional Linear Constraints ,” Networks , 7 , 59 – 79 ( 1977 ).
   Web of Science ®Google Scholar
• Engquist , M. ,Chen, C, “ Efticient Tree Handling Procedures for Allocation/Processing Networks ,” Research Report CCS 437 , Center for Cybernetic Studies, The University of Texas , Austin ( 1982 ).
   Google Scholar
• Glover , F. , Klingman , D. , and Stutz , J. , “ Augmented Threaded Index Method for Network Optimization ,” INFOR , 12 , 293 – 298 ( 1974 ).
   Google Scholar
• Glover , F. , and Klingman , D. , “ The Simplex SON Algorithm for LP/Embedded Network Problems ,” Mathematical Programming Study , IS , 148 – 176 ( 1981 ).
   Google Scholar
• Held , M. , Wolfe , P. , and Crowder , H. , “ Validation of Subgradient Optimization ,” Mathematical Programming . 6 , 66 – 68 ( 1974 ).
   Google Scholar
• Klingman , D. , and Russell , R. , “ On Solving Constrained Transportation Problems ,” Operations Research , 23 , 91 – 107 ( 1975 ).
   Web of Science ®Google Scholar
• Klingman , D. , Napier , A. , and Stutz , J. , “ NETGEN A Program for Generating Large Scale Minimum Cost Flow Network Problems ,” Management Science , 20 , 814 – 821 ( 1974 ).
   Web of Science ®Google Scholar
• Murtagh , B. , and Saunders , M. ,“ Large-Scale Linearly Constrained Optimization .“ Marhematical Programming , 14 , 41 – 72 ( 1978 ).
   Web of Science ®Google Scholar
• McBride , R, “ Solving Embedded Generalized Network Problems ,” to appear in European Journal of Operational Research .
   Web of Science ®Google Scholar
• Shepardson , F. , and Marsten , R. , “ A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem ,” Management Science , 26 , 274 – 28 I ( 1980 ).
   Web of Science ®Google Scholar
• Turnquist , M. ,Malandraki. C., “ Estimating Driver Costs for Transit Operations Planning ,” Joint National Meeting of ORSA/TIMS , Dallas ( 1984 ).
   Google Scholar