Labbé, M.Yaman, H.2016-02-082016-02-0820060926-6003http://hdl.handle.net/11693/23773The 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.EnglishConcentrator locationPolyhedral analysisComputation theoryBranch and cutArticle10.1007/s10589-005-3913-y1573-2894