Show simple item record

dc.coverage.spatialRomaes_CL
dc.creatorObreque-Niñez, Carlos Enrique
dc.creatorMarianov, Vladimir
dc.creatorCornejo-Zúñiga, Oscar
dc.creatorGutiérrez-Jarpa, Gabriel
dc.date.accessioned2018-09-14T19:45:22Z
dc.date.available2018-09-14T19:45:22Z
dc.date.issued2013es_CL
dc.identifier.urihttp://hdl.handle.net/10533/220512
dc.description.abstractThe p-cable trench is a network design problem consisting in locating p facilities and connecting each client with a facility through a cable. Cables must lie in trenches. The objective minimizes cable length and trench digging costs. WiFi systems and forest exploitation are examples of applications. We present a linear integer model and we use valid cuts based on Mixed Integer Rounding in a Branch and Cut procedure to solve it. We provide preliminary computational experience.es_CL
dc.language.isoenges_CL
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.rightsinfo:eu-repo/semantics/openAccesses_CL
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
dc.titleA Branch And Cut Method To Solve The P-Cable Trench Problemes_CL
dc.typePonencia
dc.identifier.folio1130878es_CL
dc.country.isoItaliaes_CL
dc.relation.ncongress26es_CL
dc.relation.projectidinfo:eu-repo/grantAgreement//1130878es_CL
dc.relation.setinfo:eu-repo/semantics/dataset/hdl.handle.net/10533/93486
dc.type.driverinfo:eu-repo/semantics/lecture
dc.relation.namecongEuropean Conference on Operational Researches_CL
dc.date.startcongress2013-07-01
dc.date.endcongress2013-07-04


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

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess