Search by Topic

Resources tagged with Travelling salesperson problem similar to Round-robin Scheduling:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 2 results

Broad Topics > Decision Mathematics and Combinatorics > Travelling salesperson problem

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?

problem icon

Only Connect

Stage: 3 Challenge Level: Challenge Level:1

The graph represents a salesman’s area of activity with the shops that the salesman must visit each day. What route around the shops has the minimum total distance?