Algorithms for the Simple Equal Flow Problem

References

• Ahuja R. K., Batra J. L., Gupta S. K. The parametric network feasibility problem. Cahiers Centre Etudes Rech. Oper. (1983) 25:13–22Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Inc., Upper Saddle River, NJ) Google Scholar
• Ali A. I., Kennington J. L., Shetti B. The equal flow problem. Eur. J. Oper. Res. (1988) 36:107–115Crossref, Google Scholar
• Beck P., Lasdon L., Engquist M. A reduced gradient algorithm for nonlinear network problems. ACM Trans. Math. Software (1983) 9:57–70Crossref, Google Scholar
• Carraresi P., Gallo G. Network models for vehicle and crew scheduling. Eur. J. Oper. Res. (1984) 16:139–151Crossref, Google Scholar
• Fredman M. L., Tarjan R. E. Fibonacci heaps and their uses in improved network optimization algorithms. Proc. 25th Ann. Sympos. Foundations Comput. Sci. (1984) 338–346Full paper in J. ACM 34 (1987) 596–615Google Scholar
• Grigoriadis M. D. An efficient implementation of the network simplex method. Math. Programming Stud. (1986) 26:83–111Crossref, Google Scholar
• Kennington J. L., Helgason R. V.Algorithms for Network Programming (1980) (Wiley-Interscience, New York) Google Scholar
• Kuczera G. Network linear programming codes for watersupply networks modeling. ASCE J. Water Resources Planning and Management (1992) 118:412–417Google Scholar
• Loucks D. P., Stedinger J. R., Haith D. A.Water Resource Systems Planning and Analysis (1981) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Meggido N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4:414–424Link, Google Scholar
• O'Laoghaire D. T., Himmelblau D. M.Optimal Expansion of a Water Resources System (1974) (Academic Press, NY) Google Scholar
• Sechi G. M., Zuddas P. Data management for extended multi-period analysis of water resource systems. Presented at 11th Internat. Federation Oper. Res. Soc. Conf. (IFORS'87) (1987) Buenos Aires, ArgentinaGoogle Scholar
• Sechi G. M., Zuddas P. A large scale water resources network optimization algorithm. Proc. Internat. Conf. Optim. ICOTA (1995) '95, Chengdu, ChinaGoogle Scholar
• Shepardson F., Marsten R. A Lagrangian relaxation algorithm for the two-duty period scheduling problem. Management Sci. (1980) 26:2274–2281Link, Google Scholar
• Simeone B. A network flow model for water resources management. (1974) Annual AIRO Meeting, Rome, ItalyGoogle Scholar
• Sun Y. H., Yeh W. G., Hsu N. S., Louie P. W. F. Generalized network algorithm for water-supply-system optimization. ASCE J. Water Resources Planning and Management (1995) 121:392–398Crossref, Google Scholar
• Srinivason V., Thompson G. L. An operator theory of parametric programming for the transportation problem. Naval Res. Logist. Quart. (1972) 19:205–252Crossref, Google Scholar
• Tardos E. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. (1986) 34:250–265Link, Google Scholar
• Turnquist M., Malandraki C. Estimating driver cost for transit operations planning. Joint National Meeting of ORSA/TIMS (1984) DallasGoogle Scholar
• Yeh W. G. Reservoir management and operations models: A state-of-art review. Water Resources Res. (1985) 21:1797–1818Crossref, Google Scholar