{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T05:14:06Z","timestamp":1672722846173},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1145\/356022.356025","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:29:03Z","timestamp":1027769343000},"page":"57-70","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A Reduced Gradient Algorithm for Nonlinear Network Problems"],"prefix":"10.1145","volume":"9","author":[{"given":"P.","family":"Beck","sequence":"first","affiliation":[{"name":"Department of Management Information Systems, University of Arizona, Tucson, AZ"}]},{"given":"L.","family":"Lasdon","sequence":"additional","affiliation":[{"name":"Department of General Business, School of Business Administration and Department of Mechanical Engineering, University of Texas, Austin, TX"}]},{"given":"M.","family":"Engquist","sequence":"additional","affiliation":[{"name":"Department of General Business, School of Business Administration, University of Texas, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[1983,3]]},"reference":[{"key":"e_1_2_1_1_2","volume-title":"Quadratic programming over transportation polytopes. Rep. 7767-OR","author":"BACHEM A.","year":"1977","unstructured":"BACHEM , A. , AND KORTE , B. Quadratic programming over transportation polytopes. Rep. 7767-OR , Institute for Okonometric and Operations Research , Bonn , 1977 . BACHEM, A., AND KORTE, B. Quadratic programming over transportation polytopes. Rep. 7767-OR, Institute for Okonometric and Operations Research, Bonn, 1977."},{"key":"e_1_2_1_2_2","volume-title":"A linked list data structure for a binary knapsack algorithm. Res. Rep. 232","author":"BARR R.","year":"1975","unstructured":"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 . 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."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01585504","article-title":"An improved version of the out-of-kilter method and comparative study of computer codes","volume":"7","author":"BARR R.","year":"1974","unstructured":"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 . 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.","journal-title":"Math. Program"},{"key":"e_1_2_1_4_2","first-page":"1","article-title":"Enhancements of spanning tree labeling procedures for network optimization","volume":"17","author":"BARR U.","year":"1979","unstructured":"BARR , U. , GLOVER , F. , AND KLINGMAN , D . Enhancements of spanning tree labeling procedures for network optimization . INFOR 17 , 1 ( 1979 ), 16-34. BARR, U., GLOVER, F., AND KLINGMAN, D. Enhancements of spanning tree labeling procedures for network optimization. INFOR 17, 1 (1979), 16-34.","journal-title":"INFOR"},{"key":"e_1_2_1_5_2","first-page":"39","volume-title":"Numerwal Methods for Nonlinear Optimizatmn","author":"BEALE E.","year":"1972","unstructured":"BEALE , E. A derwatlon of conjugate gradients . In Numerwal Methods for Nonlinear Optimizatmn , F. Lootsma (Ed.), Academic , London , 1972 , pp. 39 - 43 . BEALE, E. A derwatlon of conjugate gradients. In Numerwal Methods for Nonlinear Optimizatmn, F. Lootsma (Ed.), Academic, London, 1972, pp. 39-43."},{"key":"e_1_2_1_6_2","first-page":"1","article-title":"Design and implementation of large scale primal transshipment algorithms","volume":"24","author":"BRADLEY G","year":"1977","unstructured":"BRADLEY , G , BROWN , G. , AND GRAVES , G . Design and implementation of large scale primal transshipment algorithms . Manage. Sc~. 24 , 1 ( 1977 ), 1-34. BRADLEY, G, BROWN, G., AND GRAVES, G. Design and implementation of large scale primal transshipment algorithms. Manage. Sc~. 24, 1 (1977), 1-34.","journal-title":"Manage. Sc~."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0305-0548(75)90010-6","article-title":"Past, present and future of large scale transshipment computer codes and apphcations","volume":"2","author":"CHARNES A.","year":"1975","unstructured":"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. 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.","journal-title":"Comput. Oper. Res."},{"key":"e_1_2_1_8_2","volume-title":"Management Models and Industrial Applications of Linear Programming","author":"CHARNES A.","year":"1961","unstructured":"CHARNES , A. , AND COOPER , W.W. Management Models and Industrial Applications of Linear Programming , vol. I . Wiley , New York , 1961 . CHARNES, A., AND COOPER, W.W. Management Models and Industrial Applications of Linear Programming, vol. I. Wiley, New York, 1961."},{"key":"e_1_2_1_9_2","volume-title":"Management Models and Industrial Applications of Linear Programming","author":"CHARNES A.","year":"1961","unstructured":"CHARNES , A. , AND COOPER , W.W. Management Models and Industrial Applications of Linear Programming , vol. II . Wiley , New York , 1961 . CHARNES, A., AND COOPER, W.W. Management Models and Industrial Applications of Linear Programming, vol. II. Wiley, New York, 1961."},{"key":"e_1_2_1_10_2","first-page":"7","article-title":"Solving the pipe network analysis problem using optnnization techniques","volume":"24","author":"COLLINS M.","year":"1978","unstructured":"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. 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.","journal-title":"Manage. Sei."},{"key":"e_1_2_1_11_2","volume-title":"Southern Methodist Univ.","author":"COOPER L.","year":"1977","unstructured":"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 . 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."},{"key":"e_1_2_1_12_2","volume-title":"Unw. Illinois","author":"CR","year":"1936","unstructured":"CR oss, H. Analyms of flow in networks of conduits or conductors. Engineering Experiment Statmn Bull. 286 , Unw. Illinois , Urbana , 1936 . CRoss, H. Analyms of flow in networks of conduits or conductors. Engineering Experiment Statmn Bull. 286, Unw. Illinois, Urbana, 1936."},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0120941","article-title":"A scaled reduced gradient algorithm for network flow problems with convex separable costs","volume":"15","author":"DEMBO R.","year":"1981","unstructured":"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 . 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.","journal-title":"Math Program. Study"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"FLETCHER R","year":"1964","unstructured":"FLETCHER , R , AND REEVES , C . Function minimization by conjugate gradients . Comput. J. 7 ( 1964 ), 149 - 154 . FLETCHER, R, AND REEVES, C. Function minimization by conjugate gradients. Comput. J. 7 (1964), 149-154.","journal-title":"Comput. J."},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/trsc.4.2.220","article-title":"Locating stepping-stone paths in distribution problems via the predecessor index method","volume":"4","author":"GLOVER F.","year":"1970","unstructured":"GLOVER , F. , AND KLINGMAN , D . Locating stepping-stone paths in distribution problems via the predecessor index method . Transport. Sci. 4 ( 1970 ), 213 - 224 . GLOVER, F., AND KLINGMAN, D. Locating stepping-stone paths in distribution problems via the predecessor index method. Transport. Sci. 4 (1970), 213-224.","journal-title":"Transport. Sci."},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.6.2.171","article-title":"The augmented predecessor index method for locating stepping-stone paths and assigning dual prices in distribution problems","volume":"6","author":"GLOVER F.","year":"1972","unstructured":"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 . 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.","journal-title":"Transport. Sc~."},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.3230040302","article-title":"Implementatmn and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems","volume":"4","author":"GLOVER F.","year":"1974","unstructured":"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. 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.","journal-title":"Networks"},{"key":"e_1_2_1_18_2","first-page":"5","article-title":"A computational study on start procedures, basis change criteria and solution algorithms for transportation problems","volume":"20","author":"GLOVER F.","year":"1974","unstructured":"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. 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.","journal-title":"Manage. Sc~."},{"key":"e_1_2_1_19_2","first-page":"3","article-title":"Augmented threaded index method for network optimizatmn","volume":"12","author":"GLOVER F.","year":"1974","unstructured":"GLOVER , F. , KLINGMAN , D. , AND STUTZ , J Augmented threaded index method for network optimizatmn . INFOR 12 , 3 ( 1974 ), 293-298. GLOVER, F., KLINGMAN, D., AND STUTZ, J Augmented threaded index method for network optimizatmn. INFOR 12, 3 (1974), 293-298.","journal-title":"INFOR"},{"key":"e_1_2_1_20_2","first-page":"4","article-title":"A nonhnear programming technique for the optimization of continuous processmg systems","volume":"7","author":"GRIFFITH R.","year":"1961","unstructured":"GRIFFITH , R. , AND STEWART , R A nonhnear programming technique for the optimization of continuous processmg systems . Manage. Set 7 , 4 ( 1961 ) 379-392. GRIFFITH, R., AND STEWART, R A nonhnear programming technique for the optimization of continuous processmg systems. Manage. Set 7, 4 (1961) 379-392.","journal-title":"Manage. Set"},{"key":"e_1_2_1_21_2","first-page":"7","article-title":"Modeling and resolution of the medium term energy generation planning problem for a large hydroelectric system","volume":"26","author":"HANSCOM M.","year":"1978","unstructured":"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. 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.","journal-title":"Manage. Sci."},{"key":"e_1_2_1_22_2","volume-title":"Fundamentals of Data Structures","author":"HOROWITZ E.","year":"1976","unstructured":"HOROWITZ , E. , AND SARTAJ , S. Fundamentals of Data Structures . Computer Science Press , Potomac, Md ., 1976 . HOROWITZ, E., AND SARTAJ, S. Fundamentals of Data Structures. Computer Science Press, Potomac, Md., 1976."},{"key":"e_1_2_1_23_2","volume-title":"Mathematical Modeling with Computers","author":"JACOBY S.","year":"1980","unstructured":"JACOBY , S. , AND KOWALIK , J. Mathematical Modeling with Computers . Prentice-Hall , Englewood Cliffs, N. J. , 1980 . JACOBY, S., AND KOWALIK, J. Mathematical Modeling with Computers. Prentice-Hall, Englewood Cliffs, N. J., 1980."},{"key":"e_1_2_1_24_2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","article-title":"An efficient approach to solving the road network equilibrium traffic assignment problem","volume":"9","author":"LEBLANC L.","year":"1975","unstructured":"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 . 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.","journal-title":"Transport. Res."},{"key":"e_1_2_1_25_2","volume-title":"Introduction to Linear and Nonlinear Programming","author":"LUENBERGER D.","year":"1973","unstructured":"LUENBERGER , D. Introduction to Linear and Nonlinear Programming . Addison-Wesley , Reading, Mass ., 1973 . LUENBERGER, D. Introduction to Linear and Nonlinear Programming. Addison-Wesley, Reading, Mass., 1973."},{"key":"e_1_2_1_26_2","first-page":"4","article-title":"Two-segment separable programming","volume":"25","author":"MEYER R","year":"1979","unstructured":"MEYER , R . Two-segment separable programming . Manage. Sc~. 25 , 4 ( 1979 ), 385-395. MEYER, R. Two-segment separable programming. Manage. Sc~. 25, 4 (1979), 385-395.","journal-title":"Manage. Sc~."},{"key":"e_1_2_1_27_2","volume-title":"Colo.","author":"MEYER R","year":"1978","unstructured":"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 . 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."},{"key":"e_1_2_1_28_2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01609034","article-title":"Testing of a large-scale network optimization program","volume":"15","author":"MULVEY J","year":"1978","unstructured":"MULVEY , J Testing of a large-scale network optimization program . Math. Program. 15 ( 1978 ), 291 - 314 . MULVEY, J Testing of a large-scale network optimization program. Math. Program. 15 (1978), 291-314.","journal-title":"Math. Program."},{"key":"e_1_2_1_29_2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01588950","article-title":"Large scale linearly constrained optimization","volume":"14","author":"MURTAUGH B.","year":"1978","unstructured":"MURTAUGH , B. , AND SAUNDERS , M . Large scale linearly constrained optimization . Math Program. 14 ( 1978 ), 41 - 72 . MURTAUGH, B., AND SAUNDERS, M. Large scale linearly constrained optimization. Math Program. 14 (1978), 41-72.","journal-title":"Math Program."},{"key":"e_1_2_1_31_2","volume-title":"Computational Methods in Optimization: A Un~fied Approach","author":"POLAK E.","year":"1971","unstructured":"POLAK , E. , AND Rml ERE , G. Computational Methods in Optimization: A Un~fied Approach . Academic , New York , 1971 . POLAK, E., AND RmlERE, G. Computational Methods in Optimization: A Un~fied Approach. Academic, New York, 1971."},{"key":"e_1_2_1_32_2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","article-title":"Restart procedures for the conjugate gradient method","volume":"13","author":"POWELL M","year":"1977","unstructured":"POWELL , M . Restart procedures for the conjugate gradient method . Math. Program. 13 ( 1977 ), 241 - 254 . POWELL, M. Restart procedures for the conjugate gradient method. Math. Program. 13 (1977), 241-254.","journal-title":"Math. Program."},{"key":"e_1_2_1_33_2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/opre.29.4.763","article-title":"A nonlinear network flow algorithm for maximization of benefits in a hydroelectric power system","volume":"29","author":"ROSENTHAL R. E","year":"1981","unstructured":"ROSENTHAL , R. E . A nonlinear network flow algorithm for maximization of benefits in a hydroelectric power system . Oper. Res. 29 , 4 ( 1981 ), 763-786. ROSENTHAL, R. E. A nonlinear network flow algorithm for maximization of benefits in a hydroelectric power system. Oper. Res. 29, 4 (1981), 763-786.","journal-title":"Oper. Res."},{"key":"e_1_2_1_34_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/moor.3.3.244","article-title":"Conjugate gradient methods with inexact searches","volume":"3","author":"SHANNO D","year":"1978","unstructured":"SHANNO , D . Conjugate gradient methods with inexact searches . Math. Oper. Res. 3 , 3 ( 1978 ), 244-256. SHANNO, D. Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 3 (1978), 244-256.","journal-title":"Math. Oper. Res."},{"key":"e_1_2_1_35_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BFb0120952","article-title":"Conjugate gradient methods for linearly constrained nonlinear programming","volume":"16","author":"SHANNO D.","year":"1982","unstructured":"SHANNO , D. , AND MARSTEN , R . Conjugate gradient methods for linearly constrained nonlinear programming . Math. Program. Study 16 ( 1982 ), 149 - 161 . SHANNO, D., AND MARSTEN, R. Conjugate gradient methods for linearly constrained nonlinear programming. Math. Program. Study 16 (1982), 149-161.","journal-title":"Math. Program. Study"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/356022.356025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T07:07:28Z","timestamp":1672643248000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/356022.356025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["10.1145\/356022.356025"],"URL":"http:\/\/dx.doi.org\/10.1145\/356022.356025","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":["Applied Mathematics","Software"],"published":{"date-parts":[[1983,3]]},"assertion":[{"value":"1983-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}