On some discrete optimization problems

In this talk we present an overview of the research our team makes in LATNA laboratory (Laboratory of Algorithms and Technologies for Network Analysis). We start with classical combinatorial optimization problems including Vertex Coloring Problem (VCP), Maximum Clique Problem (MCP), Maximum Independent Set Problem (MISP), Minimum Vertex Cover Problem (MVCP). A number of state-of-art exact algorithms for these problems belong to Pablo San Segundo (2011-2017) and his coauthors including our team. One of the m