Assignments
salesman.pdf
Description:
This is the most useful generic models in the field of combinatorial optimization. The problem seeks a minimum cost (total distance) tour (closed path) that includes each of a given set of points.
Resource Type:
Assignments
pdf
63 kB
salesman.pdf
Course Info
Instructors
As Taught In
Spring
2004
Level
Topics
Learning Resource Types
notes
Lecture Notes
assignment
Problem Sets
