Polymath8: Bounded Gaps between Primes

Polymath8: Bounded Gaps between Primes

The Polymath8 project, led by Prof. Terence Tao and in collaboration with a team of top mathematicians, was launched to optimize the records of the bounded gaps between primes based on the breakthrough work of “Bounded gaps between primes” by Dr. Yitang

Metaheuristic Search Strategies

We have designed and realized cutting-edge metaheuristic search techniques for solving complicated combinatorial optimization problems.Some are embedded in Cooperative Group Optimization Systems, for solving Travelling Salesman Problem (TSP), Graph Coloring Problem (GCP), Quadratic Knapsack Problem (QKP), Flow-Shop Scheduling Problem (FSP), and

Solving the Magic Square Problem

Solving the Magic Square Problem

This problem is to solve the Magic Square Problem (constrained and unconstrained versions), a combinatorial optimization problem, using modern heuristic methods.Magic squares have been a source of fascination since ancient times, over 4,000 years. A magic square is a square matrix