Solution of the "Walking Bus Challenge" of the Foundations of Operations Research course of M.Sc. Computer Science and Engineering at Politecnico di Milano.

This challenge consisted in the minimization of the number of chaperons involved in the setup of a walking bus system for an elementary school, respecting some constraints that involved mainly the distance between students' houses and school and the risk of the roads.

In mathematical terms this problem is translated in a special case of the spanning tree problem, in which you have to minimize the number of leaves.

Since there was a time constraint, this solution involves heuristic and it classified fourth out of 36 proposed solutions.