Friday, May 7, 2010
Travelling Salesman Problem
The Travelling Salesman Problem ( TSP ) is broadly known. Most people seem to have heard about it and are able to describe it in laymen's terms. In MT365 - Graphs - 2 the TSP is described mathematically. Not very deep, I suppose, the TSP is introduced. The formal definition of the TSP is as follows: "Given a weighted complete graph, find a minimum-weight Hamiltonian cycle." In Graphs - 1 all the words in this definition have been given a precise meaning.
Subscribe to:
Post Comments (Atom)
Popular Posts
-
Among lectures on Calculus I,II and III, ( Introduction to ) Linear Algebra and ( Introduction to ) Differential Equations from the UCCS ( ...
-
Problem: We want to calculate the sum of the elements of a list of numbers. Suppose this list is named l and has been assigned the value {1,...
-
Today I started to read the Ramanujan biography ( The e-book version, of course. ) The book looks promising. What was it like to communicate... -
I found a set of video lectures on Abstract Algebra. MATH E-222 Abstract Algebra - http://www.extension.harvard.edu/openlearning/math222/ E...
-
Ramanujan's genius (r) was discovered by Hardy (l) At a very young age Ramanujan designed the following formula for a 3 by 3 magic sq...
Welcome to The Bridge
Mathematics: is it the fabric of MEST?
This is my voyage
My continuous mission
To uncover hidden structures
To create new theorems and proofs
To boldly go where no man has gone before
(Raumpatrouille – Die phantastischen Abenteuer des Raumschiffes Orion, colloquially aka Raumpatrouille Orion was the first German science fiction television series. Its seven episodes were broadcast by ARD beginning September 17, 1966. The series has since acquired cult status in Germany. Broadcast six years before Star Trek first aired in West Germany (in 1972), it became a huge success.)
No comments:
Post a Comment