1

BACHEM, A., AND KORTE, B. Quadratic programming over transportation polytopes. Rep. 7767-OR, Institute for Okonometric and Operations Research, Bonn, 1977.

2

BARR, R., AND ROSS, G. A linked list data structure for a binary knapsack algorithm. Res. Rep. 232, Center for Cybernetic Studies, Univ. Texas at Austin, 1975.

3

BARR, R., GLOVER, F., AND KLINGMAN, D. An improved version of the out-of-kilter method and comparative study of computer codes. Math. Program 7 (1974), 60-86.

4

BARR, U., GLOVER, F., AND KLINGMAN, D. Enhancements of spanning tree labeling procedures for network optimization. INFOR 17, 1 (1979), 16-34.

5

BEALE, E. A derwatlon of conjugate gradients. In Numerwal Methods for Nonlinear Optimizatmn, F. Lootsma (Ed.), Academic, London, 1972, pp. 39-43.

6

BRADLEY, G, BROWN, G., AND GRAVES, G. Design and implementation of large scale primal transshipment algorithms. Manage. Sc~. 24, 1 (1977), 1-34.

7

CHARNES, A., KARNEY, D., KLINGMAN, D., AND STUTZ, J. Past, present and future of large scale transshipment computer codes and apphcations. Comput. Oper. Res. 2, 2 (1975), 71-82.

8

CHARNES, A., AND COOPER, W.W. Management Models and Industrial Applications of Linear Programming, vol. I. Wiley, New York, 1961.

9

CHARNES, A., AND COOPER, W.W. Management Models and Industrial Applications of Linear Programming, vol. II. Wiley, New York, 1961.

10

COLLINS, M., COOPER, L., HELGASON, R., KENNINGTON, J., AND LEBLANC, L. Solving the pipe network analysis problem using optnnization techniques. Manage. Sei. 24, 7 (1978), 747-760.

11

COOPER, L., AND KENNINGTON, J. Steady state analysis of nonlinear resistive electrical networks using optimization techniques. Teeh. Rep. IEOR 7012, Southern Methodist Univ., Dallas, Oct. 1977.

12

CRoss, H. Analyms of flow in networks of conduits or conductors. Engineering Experiment Statmn Bull. 286, Unw. Illinois, Urbana, 1936.

13

DEMBO, R., AND KLINCEWICZ, J. A scaled reduced gradient algorithm for network flow problems with convex separable costs. Math Program. Study 15 (1981), 125-147.

14

FLETCHER, R, AND REEVES, C. Function minimization by conjugate gradients. Comput. J. 7 (1964), 149-154.

15

GLOVER, F., AND KLINGMAN, D. Locating stepping-stone paths in distribution problems via the predecessor index method. Transport. Sci. 4 (1970), 213-224.

16

GLOVER, F., KARNEY, D., AND KLINGMAN, D. The augmented predecessor index method for locating stepping-stone paths and assigning dual prices in distribution problems. Transport. Sc~. 6 (1972), 171-180.

17

GLOVER, F., KARNEY, D., AND KLINGMAN, D. Implementatmn and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems. Networks 4, 3 (1974), 191-212.

18

GLOVER, F., KARNEY, D., KLINOMAN, D., AND NAPIER, A. A computational study on start procedures, basis change criteria and solution algorithms for transportation problems. Manage. Sc~. 20, 5 (1974), 793-813.

19

GLOVER, F., KLINGMAN, D., AND STUTZ, J Augmented threaded index method for network optimizatmn. INFOR 12, 3 (1974), 293-298.

20

GRIFFITH, R., AND STEWART, R A nonhnear programming technique for the optimization of continuous processmg systems. Manage. Set 7, 4 (1961) 379-392.

21

HANSCOM, M., LAFOND, L., LASDON, L., AND PRONOVOST, G. Modeling and resolution of the medium term energy generation planning problem for a large hydroelectric system. Manage. Sci. 26, 7 (1978), 659-668.

22

HOROWITZ, E., AND SARTAJ, S. Fundamentals of Data Structures. Computer Science Press, Potomac, Md., 1976.

23

JACOBY, S., AND KOWALIK, J. Mathematical Modeling with Computers. Prentice-Hall, Englewood Cliffs, N. J., 1980.

24

LEBLANC, L., MORLOCK, E., AND PIERSKALL, W. An efficient approach to solving the road network equilibrium traffic assignment problem. Transport. Res. 9 (1975), 309-318.

25

LUENBERGER, D. Introduction to Linear and Nonlinear Programming. Addison-Wesley, Reading, Mass., 1973.

26

MEYER, R. Two-segment separable programming. Manage. Sc~. 25, 4 (1979), 385-395.

27

MEYER, R Algorithms for a class of 'convex' nonlinear integer programs. In Computers and Mathematical Programming, W. White (Ed.), National Bureau of Standards Special Publication 502, Denver, Colo., 1978.

28

MULVEY, J Testing of a large-scale network optimization program. Math. Program. 15 (1978), 291-314.

29

MURTAUGH, B., AND SAUNDERS, M. Large scale linearly constrained optimization. Math Program. 14 (1978), 41-72.

30

NGUYEN, S. A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Tech. Rep., Centre de Recherche sur lee Transports, Universite de Montreal, Montreal, P. Q., Canada, 1973.

31

POLAK, E., AND RmlERE, G. Computational Methods in Optimization: A Un~fied Approach. Academic, New York, 1971.

32

POWELL, M. Restart procedures for the conjugate gradient method. Math. Program. 13 (1977), 241-254.

33

ROSENTHAL, R. E. A nonlinear network flow algorithm for maximization of benefits in a hydroelectric power system. Oper. Res. 29, 4 (1981), 763-786.

34

SHANNO, D. Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 3 (1978), 244-256.

35

SHANNO, D., AND MARSTEN, R. Conjugate gradient methods for linearly constrained nonlinear programming. Math. Program. Study 16 (1982), 149-161.

36

SHANNO, D. On variable-metric methods for sparse Hessians. Tech. Rep. 26, Dept. of Management and Information Sciences, Univ. Arizona, Tucson, 1978.

Ph. L. Toint , D. Tuyttens, LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems, ACM Transactions on Mathematical Software (TOMS), v.18 n.3, p.308-328, Sept. 1992

David P. Ahlfeld , John M. Mulvey , Ron S. Dembo , Stavros A. Zenios, Nonlinear programming on generalized networks, ACM Transactions on Mathematical Software (TOMS), v.13 n.4, p.350-367, Dec. 1987

Vasile Bostan , Ling Li, A decision model for reducing active power losses during electric power dispatching, Computers and Operations Research, v.30 n.6, p.833-849, May 2003

P. Beck: colleagues

L. Lasdon: colleagues

M. Engquist: colleagues