Geometry.Net - the online learning center
Home  - Theorems_And_Conjectures - Traveling Salesman Problem
e99.com Bookstore
  
Images 
Newsgroups
Page 6     101-103 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6 

         Traveling Salesman Problem:     more books (100)
  1. Statistical analysis of some traveling salesman algorithms by Egon Balas, 1984
  2. A decomposition method for the travelling salesman problem and its applications by F Giannessi, 1976
  3. A traveling-salesman-based approach to aircraft scheduling in the terminal area (SuDoc NAS 1.15:100062) by Robert A. Luenberger, 1988
  4. Computational experiments on edge exchange heuristics for the Euclidean travelling salesman problem (Mathematics) by Jukka Perttunen, 1993
  5. Report / University of Illinois, Dept. of Computer Science by Edward Steinberg Davidson, 1966
  6. The Traveling Salesman: Computational Solutions for Tsp Applications (Lecture Notes in Computer Science) by Gerhard Reinelt, 1994-08
  7. A heuristic approach to solving travelling salesman problems by Robert L Karg, 1964
  8. Technical report / University at Buffalo, State University of New York, Dept. of Computer Science by Petr Slavik, 1995
  9. Quadratic set covering problem by M. S Bazaraa, 1974
  10. GMD-Mitteilungen by F Fiala, 1978
  11. A location based heuristic for general routing problems by Julien Bramel, 1992
  12. EDRC by Pedro Sergio de Souza, 1993
  13. Research report RJ. International Business Machines Corporation. Research Division by Sanjeev Arora, 1998
  14. Working paper series / Ohio State University, College of Administrative Science by W. C Benton, 1982

101. IMA Public Lecture: The Traveling Salesman (TSP) By William Cook, October 16, 20
20022003 Program Optimization. IMA PUBLIC LECTURE. The traveling SalesmanProblem. William J. Cook Industrial and Systems Engineering
http://www.ima.umn.edu/public-lecture/tsp/
Search
Contact Information
Program Registration Postdoc/Membership Application Program Feedback ...
2002-2003 Program: Optimization
IMA PUBLIC LECTURE
The Traveling Salesman Problem
William J. Cook
Industrial and Systems Engineering
Georgia Institute of Technology
wcook@isye.gatech.edu

http://www.isye.gatech.edu/~wcook/
Wednesday, October 16, 2002, 7:00 PM Moos Tower, Room 2-650
University of Minnesota
, East Bank Poster pdf jpg
http://www.math.princeton.edu/tsp/

Talk 58 mins. RealAudio(SureStream)
USA 13509 Cities
USA 13509 Maze USA 13509 Tour The traveling salesman problem, or TSP for short, is easy to state: given a number of "cities" along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point. The simplicity of the statement is deceptive - the TSP is one of the most intensely studied problems in computational mathematics and yet no effective solution method is known for the general case. Indeed, the resolution of the TSP would settle the P versus NP problem and fetch a $1,000,000 prize from the Clay Mathematics Institute. Although the complexity of the TSP is still unknown, for over 50 years its study has led the way to improved solution methods in many areas of mathematical optimization. We will discuss the history of the TSP and examine the role it has played in modern computational mathematics. We will also present a collection of TSP applications, ranging from genome sequencing to on-line grocery shopping. Finally, we will present a survey of recent progress in algorithms for large-scale TSP instances, including the solution of a million-city instance to within 0.09% of optimality and the exact solution of a 15,112-city instance.

102. Brute Force [The Jargon Dictionary]
The canonical example of a bruteforce algorithm is associated with the `travelingsalesman problem (TSP), a classical NP-hard problem Suppose a person is in
http://info.astrian.net/jargon/terms/b/brute_force.html
The Jargon Dictionary - http://info.astrian.net/jargon/terms/b/brute_force.html The Jargon Dictionary Terms The B ... Terms : brute force
brute force
brute force adj. Describes a primitive programming style, one in which the programmer relies on the computer's processing power instead of using his or her own intelligence to simplify the problem, often ignoring problems of scale and applying naive methods suited to small problems directly to large ones. The term can also be used in reference to programming style: brute-force programs are written in a heavyhanded, tedious way, full of repetition and devoid of any elegance or useful abstraction (see also brute force and ignorance The canonical example of a brute-force algorithm is associated with the `traveling salesman problem' (TSP), a classical NP- hard problem: Suppose a person is in, say, Boston, and wishes to drive to N other cities. In what order should the cities be visited in order to minimize the distance travelled? The brute-force method is to simply generate all possible routes and compare the distances; while guaranteed to work and simple to implement, this algorithm is clearly very stupid in that it considers even obviously absurd routes (like going from Boston to Houston via San Francisco and New York, in that order). For very small N it works well, but it rapidly becomes absurdly inefficient when N increases (for N = 15, there are already 1,307,674,368,000 possible routes to consider, and for N = 1000 well, see

103. Hosted By Cybercity
Bestil og administrer dine domæner hos Cybercity Nu kan du købe, flytteog administrere dine domæner på samme sted enkelt og nemt.
http://www.dk-online.dk/users/hagerup/java/tstdk.htm
Bestil og administrer dine domæner hos Cybercity
Nu kan du købe, flytte og administrere dine domæner på samme sted - enkelt og nemt.
Tjek om domænet er ledigt: www. Bestil ADSL i dag
Indtast dit telefonnummer og bestil ADSL allerede i dag.
Vælg: Erhverv Privat Tlf.:
cybercity@cybercity.dk
www.cybercity.dk

Page 6     101-103 of 103    Back | 1  | 2  | 3  | 4  | 5  | 6 

free hit counter