Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ejor.2003.04.003
Title: Quadratic cost flow and the conjugate gradient method
Authors: Sun, J. 
Yang, X.
Chen, X.
Keywords: Conjugate gradient methods
Network quadratic programming
Issue Date: 2005
Citation: Sun, J., Yang, X., Chen, X. (2005). Quadratic cost flow and the conjugate gradient method. European Journal of Operational Research 164 (1) : 104-114. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2003.04.003
Abstract: By introducing quadratic penalty terms, a convex non-separable quadratic network program can be reduced to an unconstrained optimization problem whose objective function is a piecewise quadratic and continuously differentiable function. A conjugate gradient method is applied to the reduced problem and its convergence is proved. The computation exploits the special network data structures originated from the network simplex method. This algorithmic framework allows direct extension to multicommodity cost flows. Some preliminary computational results are presented. © 2004 Elsevier B.V. All rights reserved.
Source Title: European Journal of Operational Research
URI: http://scholarbank.nus.edu.sg/handle/10635/43968
ISSN: 03772217
DOI: 10.1016/j.ejor.2003.04.003
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on May 21, 2018

WEB OF SCIENCETM
Citations

9
checked on May 21, 2018

Page view(s)

67
checked on Mar 11, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.