Polyhedral analysis for concentrator location problems
Computational Optimization and Applications
377 - 407
Item Usage Stats
MetadataShow full item record
The 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.