Abstract: The search for multiple optimal solutions in the traveling salesman problem (TSP), as a challenging multimodal optimization problem in the combinatorial domain, has received increasing ...

Abstract: The agile earth observation satellite scheduling problem (AEOSSP) with time-dependent transition times is a complex combinational optimization problem that has emerged from the development ...

The Baltimore Orioles have been struggling a bit this season, with their 27-32 record being far from what the team was hoping for during what was hopefully going to be a bounce-back season following ...

“If you are a mathematician,” one of the world’s leading mathematicians recently wrote, “you may want to make sure you are sitting down before reading further.” And you’ll definitely need to sit down ...

AI can rifle through enormous libraries of information to connect far-flung ideas—conceptual leaps remain a purely human skill. The planar unit distance problem, or Erdős problem 90, has intrigued ...

Last week, OpenAI shocked the mathematical community by revealing that one of its internal artificial intelligence (AI) models had found a counterexample to a famous conjecture made by legendary ...

Company says work on Paul Erdős planar unit distance problem shows advance in AI reasoning OpenAI has claimed a further advance in AI reasoning after its technology successfully tackled an 80-year-old ...