Abstract

Speaker: Sergiy Butenko, (Texas A&M University, Department of Industrial Engineering)

Title: On Clustering Problems in Networks

Abstract:

This talk discusses a class of clustering problems arising in several important applications, including social, telecommunication, and wireless networks. In particular, the maximum n-clique and maximum n-club problems in an arbitrary graph are introduced and their recognition versions are shown to be NP-complete. In addition, integer programming formulations are proposed and the results of sample numerical experiments are reported.

Return to the seminar page.