Beck P., Ladson L., Engquist M. (1983) A reduced gradient algorithm for nonlinear network problems. ACM Transactions on Mathematical Software 9:57-70.
Bertsekas D.P. (1980) Projected Newton methods for optimization problems with simple constraints. SIAM Journal of Control and Optimization 20:221-246.
Bradley G.H., Brown G.G., Graves G.W. (1977) Design and implementation of large scale transshipment algorithms. Management Science 24:1-34.
Burke J.V., Moré J.J., Toraldo G. Convergence properties of trust region methods for linear and convex constraints, Technical Memorandum, 116, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne; 1988.
Collins M., Cooper L., Helgason R.V., Kennington J.L., LeBlanc L.J. (1978) Solving the pipe network analysis problem using optimization techniques. Management Science 24:747-780.
Conn A.R., Gould N.I.M., Toint (1988) Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM Journal on Numerical Analysis 25:433-460.
Cooper L., Kennington J. “Steady-state analysis of nonlinear resistive networks using optimization techniques,” Technical Report IEOR 77012, Southern Methodist University, Dallas; 1977.
Dantzig G.B. Linear Programming and Extensions, Princeton University Press, Princeton, NJ; 1963.
Dembo R.S. A bending backtracking linesearch for constrained optimization, Yale School of Management, Yale University, New Haven, CT; 1984.
Dembo R.S. (1986) The performance of NLPNET, a large scale nonlinear network optimizer. Mathematical Programming Studies 26:245-249.
Dembo R.S. (1987) A primal truncated Newton algorithm with application to large scale nonlinear network optimization. Mathematical Programming Studies 31:43-71.
Dembo R.S., Eisenstate S.C., Steihaug T. (1982) Inexact Newton methods. SIAM Journal on Numerical Analysis 19(2):400-408.
Dembo R.S., Klincewicz J.G. (1981) A scaled reduced gradient algorithm for network flow problems with convex separable costs. Mathematical Programming Studies 15:125-147.
Dembo R.S., Steihaug T. (1983) Truncated-Newton algorithms for large scale unconstrained optimization. Mathematical Programming 26:190-212.
Dennis J.E., Schnabel R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NY; 1983.
Escudero L.F. (1986) A motivation for using the truncated Newton approach in a very large scale nonlinear network problem. Mathematical Programming Studies 26:240-245.
Escudero L.F. (1986) Performance evaluation of independent superbasic sets on nonlinear replicated networks. European Journal of Operational Research 23:343-355.
Fletcher R. Practical Methods of Optimization, Wiley, New York; 1980.
Florian M., Nguyen S. (1976) An application and validation of equilibrium trip assignment methods. Transportation Science 10:374-389.
.
Gill P.E., Murray W., Wright M.H. Practical Optimization, Academic Press, New York; 1981.
Glover F., Klingman D. (1985) Basis exchange characterization for the simplex SON algorithm for LP/embedded networks. Mathematical Programming Studies 24:141-157.
Griewank A., Toint (1982) Partitioned variable metric updates for large structured optimization problems. Numerische Mathematik 39:119-137.
Griewank A., Toint (1982) Local convergence analysis for partitioned quasi-Newton updates. Numerische Mathematik 39:429-448.
Griewank A., Toint (1982) On the unconstrained optimization of partially separable functions. Nonlinear Optimization 1981 , M.J.D., Powell, Academic Press, New York; 301-312.
Griewank A., Toint (1984) Numerical experiments with partially separable optimization problems. Numerical Analysis Proceedings Dundee 1983, Lecture Notes in Mathematics, Vol. 1066 , D.F., Griffiths, Springer, Berlin; 203-220.
Grigoriadis M.D. (1986) An efficient implementation of the network simplex method. Mathematical Programming Studies 26:83-111.
Hanscom M., Nguyen V.H., Strodiot J.J. (1985) A reduced subgradient algorithm for network flow problems with convex nondifferentiable costs. Proceedings of the IIASA NDO Workshop, Sopron 1984, Lecture Notes in Economics and Mathematical Systems , V.F., Demyanov, Springer, Berlin; 318-322.
Kennington J.L., Helgason R.V. Algorithms for Network Programming, Wiley, New York; 1980.
Klincewicz J.G. (1983) A Newton method for convex separable network flow problems. Networks 13:427-442.
Lawson C., Hanson R., Kincaird D., Krogh F. (1979) Basic linear algebra subprograms for Fortran usage. A.C.M. Transactions on Mathematical Software 5(3):308-371.
Gracia (1987) Optimizacion de redes no lineales convexas y separables. Actas I Seminario Internacional de Investigacion Operativa del Pais Vasco , J.P., Vilaplana, L.F., Escudero, Argitarapen Zerbitzua Euskal Herriko Unibertsitatea, Bilbao; 173-203.
Meyer R.R. (1979) Two segment separable programming. Management Science 15:385-395.
Murtagh B., Saunders M. (1978) Large scale linearly constrained optimization. Mathematical Programming 14:41-72.
Rosenthal R.E. (1981) A nonlinear network flow algorithm for maximizing the benefits in a hydroelectric power system. Operation Research 29:763-786.
Toint (1981) Towards an efficient sparsity exploiting Newton method for minimization. Sparse Matrices and Their Uses, I.S., Duff, Academic Press, London; .
Toint Test problems for partially separable optimization and results for the routine PSPMIN,” Technical Report 83/4, Dept. of Mathematics, FUNDP, Namur, Belgium; 1983.
Toint VE08AD, a routine for partially separable optimization with bounded variables, Harwell Subroutine Library, A.E.R.E., UK; 1983.
Toint (1986) Numerical solution of large sets of algebraic nonlinear equations. Mathematics of Computation 46:175-189.
Toint (1987) On large scale nonlinear least squares calculations. SIAM Journal on Scientific and Statistical Computing 8(3):416-435.
Toint VE10AD, a routine for large scale nonlinear least squares, Harwell Subroutine Library, Harwell Laboratory, UK; 1987.
Toint (1988) Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space. IMA Journal of Numerical Analysis 8:231-252.
Tuyttens D., Teghem J. (1986) Théorie des matroides et optimisation combinatoire. Belgian Journal of Operations Research, Statistics and Computer Science 26(1):27-62.
Zenios S. “Numerical optimization benchmarks on advanced architecture computers,” Report 88-04-03, Decision Sciences Department, The Wharton School, University of Pennsylvania, Philadelphia, PA; 1988.
