Next Generation International Research Hub for Algorithms, Combinatorial Optimization and Discrete Mathematics (CODMA Frontiers)
Purpose
Combinatorial optimization and discrete mathematics are foundational pillars of algorithm designs. In addition to their significance as a theoretical discipline, they are ubiquitous in practice, with applications in every scientific discipline. Over the past few decades, this has spawned research in many different directions within algorithms, and these individual research areas have become essential roles in the evolution of algorithm research. Moreover, they have led to many advancements in algorithms and computational theory. Techniques like dynamic programming, integer programming, and heuristics emerged from combinatorial optimization, pushing the boundaries of solving NP-hard problems. These innovations not only deepen our understanding of computational complexity but also power modern technologies, such as AI (robot path planning) and big data analytics (feature selection in machine learning).