Meta's work made headlines and raised a possibility once considered pure fantasy: that AI could soon outperform the world's best mathematicians by cracking math's marquee "unsolvable" problems en ...

Abstract: The Traveling Salesman Problem (TSP) is a widely studied NP-complete optimization challenge with significant theoretical and practical implications. This study proposes a hybrid ...

Here are 11 free NPTEL data science and analytics courses from leading IITs cover graph theory, Bayesian modelling, Python, R ...

Abstract: We investigate the algorithmic problem of uniformly dispersing a swarm of robots in an unknown, grid-like environment. In this setting, our goal is to study the relationships between ...

This repository provides a solution to the standard Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). In a CVRPTW, we aim to optimize the routes of a fleet of vehicles serving customers ...