University of Twente Student Theses

Login

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

Petrov, B.P. (2020) Algorithms for finding the Euclidian distance between a point and a polytope with application to spanning tree polytopes.

[img] PDF
473kB
Abstract: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.
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:31 mathematics
Programme:Applied Mathematics BSc (56965)
Link to this item:http://purl.utwente.nl/essays/81914
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page