Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints

DOI10.1051/RO/1981150201851zbMATH Open0457.90049OpenAlexW2587412661MaRDI QIDQ3907404FDOQ3907404

Authors: Jean-Yves Serreault, Michel Minoux 

Publication date: 1981

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104785

zbMATH Keywords

connected graphsubgradient optimizationBenders decompositioncomputational resultsLagrangean relaxationsecurity constraintssubgradient algorithmstelecommunication network optimizationoptimum multicommodity network synthesis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10)

This page was built for publication: Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3907404)