Abstract: The Heterogeneous Fleet Vehicle Routing Problem (HFVRP) aims to find optimal routes for vehicles with different capacities and costs, and is common in real-world applications. Total cost and ...

This package contains a certified proof artifact for a pointwise lower bound in the planar unit-distance problem. It uses Sawin's number-field construction and a prime-ideal microselection ...

For nearly 80 years, mathematicians have struggled to solve a classic geometry puzzle first posed by Paul Erdős in 1946: the planar unit distance problem. The question posed by the legendary Hungarian ...

Abstract: The capacitated electric vehicle routing problem (CEVRP) has drawn much attention from researchers in the recent decade against the background of the rising electric transportation industry.

After 80 years of fruitless struggle by human mathematicians, a major geometry conjecture has at last been solved—via a straightforward query to a chatbot. “No previous AI-generated proof has come ...

For 80 years, one of the most stubborn problems in combinatorial geometry sat on the shelf, occasionally dusted off by ambitious mathematicians, never quite cracked. Now an AI did it. An internal ...