Interactive Examples

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.

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.

The Test Case Assignment Problem (TCAP) is an optimization challenge where you need to assign test cases or projects to teams while minimizing makespan, total time, or weighted priority.

This interactive solver supports multiple objectives and formats, with visual results showing team workloads and assignments.