Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- 1 September 2001
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 112 (1-3), 73-99
- https://doi.org/10.1016/s0166-218x(00)00310-3
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Solving semidefinite quadratic problems within nonsmooth optimization algorithmsComputers & Operations Research, 1996
- Conditional subgradient optimization — Theory and applicationsEuropean Journal of Operational Research, 1996
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical ResultsSIAM Journal on Optimization, 1992
- Topological design of telecommunication networks-local access design methodsAnnals of Operations Research, 1991
- Networks synthesis and optimum network design problems: Models, solution methods and applicationsNetworks, 1989
- Chapter VII Nondifferentiable optimizationPublished by Elsevier BV ,1989
- On improving relaxation methods by modified gradient techniquesPublished by Springer Science and Business Media LLC ,1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Minimization of unsmooth functionalsUSSR Computational Mathematics and Mathematical Physics, 1969