{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T17:29:04Z","timestamp":1772386144652,"version":"3.50.1"},"reference-count":35,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5581,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1991,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A Lagrangian dual approach for large\u2010scale quadratic programs due to Lin and Pang is adapted to the quadratic cost network flow problem. The unconstrained dual problem is solved iteratively by combining conjugate gradient directions with<jats:italic>finite<\/jats:italic>line\u2010search methods. By exploiting the graph structure, matrix and vector operations are streamlined so that the technique can be used for large problems. A computational study of randomly generated networks with up to 500 nodes and 20,000 arcs gives a comparison between combinations of different conjugate direction formulas with three line\u2010search techniques. The results demonstrate the clear superiority of the Polak\u2010Ribiere direction formula combined with a variant of a line\u2010search technique originally developed by Bitran and Hax for convex knapsack problems.<\/jats:p>","DOI":"10.1002\/net.3230210407","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T11:18:01Z","timestamp":1178968681000},"page":"469-485","source":"Crossref","is-referenced-by-count":23,"title":["Computational development of a lagrangian dual approach for quadratic networks"],"prefix":"10.1002","volume":"21","author":[{"given":"Jose A.","family":"Ventura","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90211-6"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/356022.356025"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0325006"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0325067"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.27.4.431"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.7.747"},{"key":"e_1_2_1_8_2","unstructured":"L.CooperandJ.Kennington Steady state analysis of nonlinear resistive electrical networks using optimization techniques. Technical Report IEOR 77012 Southern Methodist University Dallas TX (1977)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120964"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800330106"},{"key":"e_1_2_1_11_2","unstructured":"L. H.Cox Solving statistical confidentiality problems via network optimization. TIMS\/ORSA Joint National Meeting New Orleans LA (1987)."},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF03000397","article-title":"Comparison of different methods for the calculation of traffic matrices","volume":"35","author":"Debiesse J. L.","year":"1980","journal-title":"Ann. Telecommun."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121178"},{"key":"e_1_2_1_14_2","first-page":"124","article-title":"A scaled reduced gradient algorithm for network flow problems with convex separable costs","volume":"15","author":"Dembo R. S.","year":"1981","journal-title":"Math. Program. Study"},{"key":"e_1_2_1_15_2","volume-title":"Optimal Economic Operation of Electric Power Systems","author":"El\u2010Hawary M. E.","year":"1979"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.149"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588953"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121181"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588328"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121016"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130310"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190108"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.814"},{"key":"e_1_2_1_25_2","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800230403"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.19.4.445"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/0325023"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01608999"},{"key":"e_1_2_1_30_2","volume-title":"Linear and Nonlinear Programming","author":"Luenberger D. G.","year":"1984"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90160-7"},{"key":"e_1_2_1_32_2","unstructured":"J. M.Mulvey S. A.Zenios andD. P.Ahlfeld Simplicial decomposition for convex generalized networks. Research Report No. EES\u201085\u20108 Civil Engineering Department Princeton University Princeton NJ (1985)."},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140404"},{"key":"e_1_2_1_34_2","first-page":"35","article-title":"Note sur la Convergence de Methods de Directions Conjugres","volume":"16","author":"Polak E.","year":"1969","journal-title":"Rev. Fr. Informat Rech. Operationnelle"},{"key":"e_1_2_1_35_2","doi-asserted-by":"crossref","unstructured":"J. A.Ventura Algorithms for quadratic transportation networks.Proceedings of the 28th IEEE Conference on Decision and Control Tampa Florida (1989)1131\u20131135.","DOI":"10.1109\/CDC.1989.70310"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02739237"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230210407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230210407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:50:03Z","timestamp":1737006603000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230210407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["10.1002\/net.3230210407"],"URL":"https:\/\/doi.org\/10.1002\/net.3230210407","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}