| Article ID: | iaor2007565 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 3 |
| Start Page Number: | 377 |
| End Page Number: | 407 |
| Publication Date: | Jul 2006 |
| Journal: | Computational Optimization and Applications |
| Authors: | Labb Martine, Yaman Hande |
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.