Show simple item record

dc.contributor.authorKerivin, Hervé
dc.contributor.authorMahjoub, Ali Ridha
dc.date.accessioned2009-10-05T13:43:37Z
dc.date.available2009-10-05T13:43:37Z
dc.date.issued2005
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2118
dc.language.isoenen
dc.subjectSurvivable networken
dc.subjectHeuristicen
dc.subjectPolyhedral approachen
dc.subjectHop-constrainten
dc.subject.ddc519en
dc.titleDesign of Survivable Networks: A surveyen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversité Blaise Pascal, Clermont-Ferrand II;France
dc.contributor.editoruniversityotherInstitute for Mathematics and its Applications, University of Minnesota;États-Unis
dc.description.abstractenFor the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them.en
dc.relation.isversionofjnlnameNetworks
dc.relation.isversionofjnlvol46en
dc.relation.isversionofjnlissue1en
dc.relation.isversionofjnldate2005
dc.relation.isversionofjnlpages1-21en
dc.relation.isversionofdoihttp://dx.doi.org/10.1002/net.20072en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherWileyen
dc.subject.ddclabelProbabilités et mathématiques appliquéesen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record