Algorithms for finding the Euclidian distance between a point and a polytope with application to spanning tree polytopes

The problem of determining the distance between a point and a polytope is investigated. Two ways of solving it are presented: a specialized algorithm by P. Wolfe and a generic quadratic programming algorithm. Both of these are then applied to spanning tree polytopes. The results of experiments show that the specialized algorithm is better suited for this problem.