Polyhedral Analysis for Concentrator Location Problems

Authors:
Martine Labbé;Hande Yaman
Affiliations:
Département d'Informatique, Université Libre de Bruxelles, Bruxelles, Belgium 1050;Department of Industrial Engineering, Bilkent University, Bilkent, Turkey 06800
Venue:
Computational Optimization and Applications
Year:
2006

Citing 9
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Capacitated facility location: valid inequalities and facets

Mathematics of Operations Research
Capacitated facility location: separation algorithms and computational experience

Mathematical Programming: Series A and B - Special issue on computational integer programming
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Lifted Cover Inequalities for 0-1 Integer Programs: Computation

INFORMS Journal on Computing
A branch and cut algorithm for hub location problems with single assignment

Mathematical Programming: Series A and B
Solving the Hub location problem in telecommunication network design: A local search approach

Networks

Quantified Score

Hi-index	0.00

Visualization

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.