A branch and cut algorithm for the hierarchical network design problem

Simple item page
dc.contributor.authorObreque, Carlos
dc.contributor.authorDonoso, Macarena
dc.contributor.authorGutierrez, Gabriel
dc.contributor.authorMarianov, Vladimir
dc.date.accessioned2024-01-10T13:45:32Z
dc.date.available2024-01-10T13:45:32Z
dc.date.issued2010
dc.description.abstractThe Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting the remaining nodes to the path. We optimally solve the problem using an ad hoc branch and cut procedure. Relaxed versions of a base model are solved using an optimization package and, if binary variables have fractional values or if some of the relaxed constraints are violated in the solution, cutting planes are added. Once no more cuts can be added. branch and bound is used. The method for finding valid cutting planes is presented. Finally, we use different available test instances to compare the procedure with the best known published optimal procedure, with good results. In none of the instances we needed to apply branch and bound, but only the cutting planes. (C) 2008 Elsevier B.V. All rights reserved.
dc.description.funderFONDECYT
dc.description.funderInstituto Cientifico Milenici "Complex Engineering Systems"
dc.fechaingreso.objetodigital2024-04-16
dc.format.extent8 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.ejor.2008.12.022
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2008.12.022
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/79046
dc.identifier.wosidWOS:000270347700004
dc.information.autorucIngeniería;Marianov V;S/I;99349
dc.issue.numero1
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final35
dc.pagina.inicio28
dc.publisherELSEVIER SCIENCE BV
dc.revistaEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.rightsacceso restringido
dc.subjectExtensive facility location
dc.subjectHierarchical networks
dc.subjectBranch and cut
dc.subjectCutting planes
dc.subjectFORMULATION
dc.subject.ods11 Sustainable Cities and Communities
dc.subject.odspa11 Ciudades y comunidades sostenibles
dc.titleA branch and cut algorithm for the hierarchical network design problem
dc.typeartículo
dc.volumen200
sipa.codpersvinculados99349
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A branch and cut algorithm for the hierarchical network design problem.pdf
Size:
2.53 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas