Branch and cut algorithms for concentrator location problems

by

Hande Yaman
Bilkent University 

The first part of this talk is an introduction to polyhedral study and
branch and cut algorithms. In the second part, we present branch and cut
algorithms for concentrator location problems that arise in
telecommunication networks. We give computational results and show that for
some problems, large formulations can be computationally advantageous when
solved using branch and cut algorithms.