Survivable capacitated network design problem: new formulation and Lagrangean relaxation

Simple item page
dc.contributor.authorRios, M
dc.contributor.authorMarianov, V
dc.contributor.authorGutierrez, M
dc.date.accessioned2024-01-10T14:21:47Z
dc.date.available2024-01-10T14:21:47Z
dc.date.issued2000
dc.description.abstractThis work is focused on the analysis of the survivable capacitated network design problem. This problem can be stated as follows: Given a supply network with point-to-point traffic demands, specific survivability requirements, a set of available capacity ranges and their corresponding discrete costs for each are, find minimum cost capacity expansions such that these demands can be met even if a network component fails. Solving this problem consists of selecting the links and their capacity, as well as the routings for each demand in every failure situation. This type of problem can be shown to be NP-hard. A new linear mixed-integer mathematical programming formulation is presented. An effective solution procedure based on Lagrangean relaxation is developed. Comparison heuristics and improvement heuristics are also described. Computational results using these procedures on different sizes of randomly generated networks are reported.
dc.fechaingreso.objetodigital2024-04-25
dc.format.extent9 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1057/palgrave.jors.2600913
dc.identifier.eissn1476-9360
dc.identifier.issn0160-5682
dc.identifier.urihttps://doi.org/10.1057/palgrave.jors.2600913
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/79780
dc.identifier.wosidWOS:000087118600008
dc.information.autorucIngeniería;Marianov V;S/I;99349
dc.information.autorucIngeniería;Ríos M;S/I;99584
dc.issue.numero5
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final582
dc.pagina.inicio574
dc.publisherPALGRAVE MACMILLAN LTD
dc.revistaJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
dc.rightsacceso restringido
dc.subjectsurvivable network
dc.subjectdisjoint paths
dc.subjectcapacity assignment
dc.subjectLagrangean relaxation
dc.subjectFLOW PROBLEM
dc.subject.ods11 Sustainable Cities and Communities
dc.subject.odspa11 Ciudades y comunidades sostenibles
dc.titleSurvivable capacitated network design problem: new formulation and Lagrangean relaxation
dc.typeartículo
dc.volumen51
sipa.codpersvinculados99349
sipa.codpersvinculados99584
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2024-04-25. Survivable capacitated network design problem - newformulation and Lagrangean relaxation.pdf
Size:
2.63 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas