Show simple item record

dc.contributor.authorObreque, Carlos
dc.contributor.authorDonoso, Macarena
dc.contributor.authorGutiérrez, Gabriel
dc.contributor.authorMarianov, Vladimir
dc.identifier.citationEuropean Journal of Operational Research 200es_CL
dc.descriptionArtículo de publicación ISI
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.es_CL
dc.rightsAtribucion-Nocomercial-SinDerivadas 3.0 Chile
dc.subjectExtensive facility locationes_CL
dc.subjectHierarchical networkses_CL
dc.subjectBranch and cutes_CL
dc.subjectCutting planeses_CL
dc.titleA branch and cut algorithm for the hierarchical network design problemes_CL

Files in this item


This item appears in the following Collection(s)

Show simple item record

Atribucion-Nocomercial-SinDerivadas 3.0 Chile
Except where otherwise noted, this item's license is described as Atribucion-Nocomercial-SinDerivadas 3.0 Chile