Interactive Examples
Explore optimization and AI concepts through these interactive demonstrations
30-City Traveling Salesman Problem
Explore the classic optimization challenge of finding the shortest route through multiple cities
The Traveling Salesman Problem (TSP) is a fundamental optimization challenge: given a list of cities and the distances between them, what is the shortest possible route that visits each city exactly once and returns to the origin?
This interactive demo lets you manually solve a 30-city TSP instance by clicking on cities to build your route.
Simple Range Scheduling
Learn how to optimize scheduling of tasks with different start and end times
Range scheduling is an optimization problem where you need to select the maximum number of non-overlapping tasks from a set of tasks with different start and end times.
This interactive demo illustrates the greedy algorithm approach to solving range scheduling problems efficiently.