Browsing Combinatorics and Optimization by Subject "Traveling Salesman Problem"
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, ... -
A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem
(University of Waterloo, 2010-09-29)The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities ...