Polyhedral analysis for concentrator location problems
Date
2006
Authors
Labbé, M.
Yaman, H.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Computational Optimization and Applications
Print ISSN
0926-6003
Electronic ISSN
1573-2894
Publisher
Springer
Volume
34
Issue
3
Pages
377 - 407
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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.