Publicación:
A BRANCH AND CUT ALGORITHM FOR THE HIERARCHICAL NETWORK DESIGN PROBLEM

Vista sencilla de ítem
dc.creatorCARLOS ENRIQUE OBREQUE NÍÑEZ
dc.date2010
dc.date.accessioned2025-01-10T14:29:15Z
dc.date.available2025-01-10T14:29:15Z
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.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.ejor.2008.12.022
dc.identifier.issn1872-6860
dc.identifier.issn0377-2217
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/7647
dc.languagespa
dc.publisherEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.relation.uri10.1016/j.ejor.2008.12.022
dc.rightsPUBLICADA
dc.subjectHIERARCHICAL NETWORKS
dc.subjectEXTENSIVE FACILITY LOCATIÓN
dc.subjectCUTTING PLANES
dc.subjectBRANCH AN CUT
dc.titleA BRANCH AND CUT ALGORITHM FOR THE HIERARCHICAL NETWORK DESIGN PROBLEM
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos