Clique relaxation models that were originally introduced in the literature on social network analysis are not only gaining increasing popularity in a wide spectrum of complex network applications, but also keep garnering attention of mathematicians, computer scientists, and operations researchers as a promising avenue for fruitful theoretical investigations. This lecture discusses the origins of clique relaxation concepts and provides a brief overview of recent developments in theory behind them, algorithms for solving the corresponding optimization problems, and selected real-life applications of the models of interest.
Language: English
Duration: 2 academic hours
Tutor of the course:
S. Butenko, Texas A&M University, USA