Show simple item record

dc.contributor.authorLabbé, M.en_US
dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T10:18:56Z
dc.date.available2016-02-08T10:18:56Z
dc.date.issued2006en_US
dc.identifier.issn0926-6003
dc.identifier.urihttp://hdl.handle.net/11693/23773
dc.description.abstractThe concentrator location problem is to choose a subset of a given terminal set to install concentrators and to assign each remaining terminal node to a concentrator to minimize the cost of installation and assignment. The concentrators may have capacity constraints. We study the polyhedral properties of concentrator location problems with different capacity structures. We develop a branch and cut algorithm and present computational results.en_US
dc.language.isoEnglishen_US
dc.source.titleComputational Optimization and Applicationsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10589-005-3913-yen_US
dc.subjectConcentrator locationen_US
dc.subjectPolyhedral analysisen_US
dc.subjectComputation theoryen_US
dc.subjectBranch and cuten_US
dc.titlePolyhedral analysis for concentrator location problemsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage377en_US
dc.citation.epage407en_US
dc.citation.volumeNumber34en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1007/s10589-005-3913-yen_US
dc.publisherSpringeren_US
dc.identifier.eissn1573-2894


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record