In mid-May, OpenAI announced that an internal AI model had disproved the Erdős unit distance conjecture, a famous problem in discrete geometry that had stumped human mathematicians for the last 80 ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

What if the next new mathematical discovery didn’t come from a human mind, but from an AI? Imagine a machine not just crunching numbers but proposing original solutions to problems that have baffled ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

Asia's only mathematics optimization competition, with total prize money of approximately USD 130,000Open to university and corporate participants worldwide. Last year's entrants included students ...