Browsing Combinatorics and Optimization by Subject "TSP"
Now showing items 1-2 of 2
-
Dynamic Programming: Salesman to Surgeon
(University of Waterloo, 2013-05-15)Dynamic Programming is an optimization technique used in computer science and mathematics. Introduced in the 1950s, it has been applied to many classic combinatorial optimization problems, such as the Shortest Path Problem, ... -
Primal Cutting Plane Methods for the Traveling Salesman Problem
(University of Waterloo, 2017-04-26)Most serious attempts at solving the traveling salesman problem (TSP) are based on the dual fractional cutting plane approach, which moves from one lower bound to the next. This thesis describes methods for implementing ...