Abstract
Consider a single-commodity directed network with m nodes and n arcs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bihain, A., Nguyen, V.H., and Strodiot, J.J. (1984). A reduced subgradient algorithm. Internal report 84/3. Department of Mathematics. Facultés Universitaires N.-D. de la Paix, Namur, Belgium.
Dembo, R.S., and Klincewicz, J.G. (1981). A scaled reduced gradient algorithm for network flow problems with convex separable costs. Mathematical Programming Study, 15: 125–147.
Hanscom, M., Lafond, L., Lasdon, L., and Pronovost, G. (1980). Modeling and resolution of the medium term energy generation planning problem for a large hydro-electric system. Management Science, 26: 659–668.
Kennington, J., and Helgason, R. (1980). Algorithms for network programming. Wiley, New York.
Murtagh, B., and Saunders, M. (1978). Large scale linearly constrained optimization. Mathematical Programming, 14: 41–72.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanscom, M.A., Nguyen, V.H., Strodiot, J.J. (1985). A Reduced Subgradient Algorithm for Network Flow Problems with Convex Nondifferentiable Costs. In: Demyanov, V.F., Pallaschke, D. (eds) Nondifferentiable Optimization: Motivations and Applications. Lecture Notes in Economics and Mathematical Systems, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12603-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-12603-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15979-7
Online ISBN: 978-3-662-12603-5
eBook Packages: Springer Book Archive