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

From MaRDI portal
Publication:3907404


DOI10.1051/RO/1981150201851MaRDI QIDQ3907404zbMATH OpenOpenAlexFDO

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3907404&oldid=17563110"
Powered by MediaWiki