41. Traveling Salesman Problem - Application Center Traveling Salesman Problem The Traveling Salesman Problem (TSP) is a fascinating optimization problem in which a salesman wishes to visit each of N cities exactly once and http://www.maplesoft.com/applications/view.aspx?SID=6873

42. Slashdot News Story | Bees Beat Machines At 'Traveling Salesman' Problem Oct 25, 2010 Now, that s no traveling salesman problem but slime molds are The canonical traveling salesman problem usually is states that all http://news.slashdot.org/story/10/10/25/1440216/Bees-Beat-Machines-At-Traveling-

43. Travelling Salesman - Wikipedia, The Free Encyclopedia A travelling salesman is a travelling vendor of goods. Travelling salesman may also refer to Traveling Salesman, a 1921 comedy film Traveling Salesmen (The Office episode), the twelfth http://en.wikipedia.org/wiki/Traveling_salesman

Travelling salesman From Wikipedia, the free encyclopedia   (Redirected from Traveling salesman Jump to: navigation search A travelling salesman is a travelling vendor of goods Travelling salesman may also refer to: Traveling Salesman (film) , a 1921 comedy film "Traveling Salesmen" ( The Office episode) , the twelfth episode of the third season of the US version of The Office Travelling salesman problem , a problem in discrete or combinatorial optimization This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article. Retrieved from " http://en.wikipedia.org/wiki/Travelling_salesman Categories Disambiguation pages Hidden categories: All article disambiguation pages All disambiguation pages Personal tools New features Log in / create account Namespaces Article Discussion Variants Views Read Edit View history Actions Search Navigation Main page Contents Featured content Current events ... Donate Interaction About Wikipedia Community portal Recent changes Contact Wikipedia ... Help Toolbox What links here Related changes Upload file Special pages ... Cite this page Print/export Create a book Download as PDF Printable version Languages Français Italiano This page was last modified on 25 August 2010 at 21:59.

44. ZIP-Methode: Neuer Kombinatorischer L�sungsansatz F�r TSP (Traveling-Salesman-Pr Mit der ZIP-Methode ist es m glich, alle Rundreisen auf eine minimale Anzahl von Grundformen zur ckzuf hren. Diese Berechnung erfordert nur einen Bruchteil des Aufwandes im Vergleich zur Berechnung aller Rundreisen. http://www.jochen-pleines.de/

HOME INHALT DOWNLOAD AUTOR IMPRESSUM K�nnen bekannte L�sungen nicht nur auf Graphen (Rundreisen) sondern auch auf Teilgraphen angewandt werden, so bringt die ZIP-Methode den entscheidenden Quantensprung der rechentechnischen Vereinfachung. ein kombinatorischer Ansatz zur optimalen L�sung allgemeiner Traveling-Salesman-Probleme (TSP) Vorbemerkung: Zur Idee der ZIP-Methode ZIP-Methode.pdf (813 KB) Pr�sentation zur ZIP-Methode aktueller Stand: � Jochen Pleines. Alle Rechte vorbehalten. Nachdruck mit Quellenangabe gestattet. Belegexemplar erbeten. Kurzfassung abstract r�sum� Ismertet� ... resumen

45. Little Paper - The College Of Engineering At UMass Amherst File Format PDF/Adobe Acrobat Quick View http://www.ecs.umass.edu/ece/tessier/courses/669/little.pdf

46. Traveling Salesman Problem Problem A traveling salesman has to travel through a bunch of cities, in such a way that the expenses on traveling are minimized. This is the infamous Traveling Salesman http://valis.cs.uiuc.edu/~sariel/research/CG/applets/tsp/TspAlg.html

Home Bookmarks Search (Re)search ... Papers Traveling Salesman Problem Approximation Algorithms Applet By Kreimer Natasha. Problem: A traveling salesman has to travel through a bunch of cities, in such a way that the expenses on traveling are minimized. This is the infamous Traveling Salesman Problem (aka TSP ) problem ( formal defintion ). It belongs to a family of problems, called NP-complete problem. It is conjectured that all those problems requires exponential time to solve them. In our case, this means that to find the optimal solution you have to go through all possible routes, and the numbers of routes increases exponential with the numbers of cities. If you want to get a notion of what numbers we are talking about look at this: the number of routes with 50 cities is (50-2)!, which is An alternative approach would be to compute a solution which is not optimal, but is guarenteed to be close the optimal solution. We present here an applet that implements such an approximation algorithm for the Euclidean TSP problem. In our case we have points in the plane (i.e. cities) and the cost of the traveling between two points is the distance between them. In other words, we have a map with cities, any two of which are connected by a direct straight road (yeh, sure!) and we want to find a shortest tour for our poor traveling salesman, who "wants" to visit every city.

47. Bees Solve 'Traveling Salesman Problem,' Tiny Brains Can Tackle Complex Math Bet Oct 25, 2010 Bees can solve complex mathematical problems which keep computers busy for days, research has shown. http://www.huffingtonpost.com/2010/10/25/bees-solve-traveling-sale_n_773315.html

48. Thermodynamical Approach To The Traveling Salesman Problem An File Format PDF/Adobe Acrobat Quick View http://mkweb.bcgsc.ca/papers/cerny-travelingsalesman.pdf

49. Traveling Salesman Problem | Define Traveling Salesman Problem At Dictionary.com –noun any mathematical problem that involves determination of the shortest path through several points. Use Traveling salesman problem in a Sentence See images of Traveling http://dictionary.reference.com/browse/Traveling salesman problem

50. Slashdot News Story | Bees Beat Machines At 'Traveling Salesman' Problem The traveling salesman problem or travelling salesman problem (TSP), also known as the traveling salesperson problem, is a problem in discrete or combinatorial optimization. http://news.slashdot.org/story/10/10/25/1440216/Bees-Beat-Machines-At-Traveling-

51. [0804.0735] Generalized Traveling Salesman Problem Reduction Algorithms by G Gutin 2008 - Cited by 4 - Related articles http://arxiv.org/abs/0804.0735

arXiv.org cs Search or Article-id Help Advanced search All papers Titles Authors Abstracts Full text Help pages Full-text links: Download: PDF PostScript Other formats Current browse context: cs.DS new recent Change to browse by: cs NASA ADS DBLP - CS Bibliography listing bibtex Gregory Gutin Daniel Karapetyan Bookmark what is this? Computer Science > Data Structures and Algorithms Title: Generalized Traveling Salesman Problem Reduction Algorithms Authors: Gregory Gutin Daniel Karapetyan (Submitted on 4 Apr 2008 ( ), last revised 14 Apr 2009 (this version, v2)) Abstract: The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a problem reduction algorithm that deletes redundant vertices and edges, preserving the optimal solution. The algorithm's running time is O(N^3) in the worst case, but it is significantly faster in practice. The algorithm has reduced the problem size by 15-20% on average in our experiments and this has decreased the solution time by 10-60% for each of the considered solvers. Comments: To appear in Algorithmic Operations Research Subjects: Data Structures and Algorithms (cs.DS)

52. Traveling-Salesman Problem supported by the DFG Oct 2004 Sep 2006 and Oct 2007 - Feb 2010 http://www.informatik.uni-halle.de/ti/forschung/toleranzen/index.en.php

var page_id=107483; Martin Luther University Halle-Wittenberg Current language: English Wechseln zur deutschen Sprachversion Jump directly to: To the beginning of the text (Jump over the navigation) Main navigation Themes navigation To the search ... More settings Navigation by theme Study Research Continuing education Career ... RSS Search Search the website Search Main navigation The university Faculties Naturwissenschaftliche Fakult�t III - Agrar-, Geowissenschaften, Mathematik und Informatik Institute of Computer Science ... Our Team`s Research Topics Traveling-Salesman Problem Project collaborators Publications Source codes Literature ... University hospitals Further settings Deutsch Fontsize: increase decrease Enhanced search Login for editors Username: Password: Traveling-Salesman Problem supported by the DFG Oct 2004 - Sep 2006 and Oct 2007 - Feb 2010 Overview News The Traveling Salesman Problem ( TSP Which importance has the ... How is the project originated? News The Traveling Salesman Problem ( TSP The Traveling Salesman Problem ( TSP ) is one of the most famous problem of combinatorial optimization. Given a weighted complete graph, the task to perform is finding a cheapest tour which visits every vertex.

53. On The Properties Of The Stem And Cycle State For The Traveling File Format PDF/Adobe Acrobat Quick View http://hces.bus.olemiss.edu/reports/hces0603.pdf

54. Approximation - An O(logn/log Logn)-approximation Algorithm For File Format PDF/Adobe Acrobat Quick View http://www.siam.org/proceedings/soda/2010/SODA10_032_asadpoura.pdf

55. Conquering The Traveling Salesman Problem A new algorithm which could provide a solution to the age old Traveling Salesman Problem (TSP) has been improved by a student. http://www.sciencedaily.com/releases/2009/07/090715075136.htm

56. Traveling Salesman Problem Definition Of Traveling Salesman Problem In The Free traveling salesman problem trav əl iŋ ′sālz mən ‚pr b ləm (mathematics) The problem of performing successively a number of tasks, represented by vertices of a http://encyclopedia2.thefreedictionary.com/traveling salesman problem

57. MATLAB Central - File Detail - Traveling Salesman Problem - Genetic Algorithm Traveling Salesman Problem Genetic Algorithm. by Joseph Kirk . 16 Jan 2007 (Updated 02 Jun 2009) Code covered by the BSD License http://www.mathworks.com/matlabcentral/fileexchange/13680

Search: MATLAB Central File Exchange MATLAB Newsgroup Link Exchange Blogs Programming Contest MathWorks.com All of MathWorks.com Login Create Account Login File Exchange ... Rate this file 253 downloads (last 30 days) File Size: 2.94 KB File ID: #13680 View full size image Traveling Salesman Problem - Genetic Algorithm by Joseph Kirk 16 Jan 2007 (Updated 02 Jun 2009) Code covered by the BSD License Finds a near-optimal solution to a TSP using a GA Download Now Watch this File File Information Description TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to the starting city) Summary: 1. A single salesman travels to each of the cities and completes the route by returning to the city he started from 2. Each city is visited by the salesman exactly once Input: XY (float) is an Nx2 (or Nx3) matrix of cities DMAT (float) is an NxN matrix of point to point distances/costs POP_SIZE (scalar integer) is the size of the population (should be divisible by 4) NUM_ITER (scalar integer) is the number of desired iterations for the algorithm to run SHOW_PROG (scalar logical) shows the GA progress if true SHOW_RES (scalar logical) shows the GA results if true Output: OPT_RTE (integer array) is the best route found by the algorithm MIN_DIST (scalar float) is the cost of the best route

58. A Comparison Of Nature Inspired Heuristics On The Traveling File Format PDF/Adobe Acrobat Quick View http://www.agent.ai/doc/upload/200302/stut00.pdf

59. Traveling Salesman Problem (mathematics) -- Britannica Online Encyclopedia traveling salesman problem (mathematics), an optimization problem in graph theory in which the nodes (cities) of a graph are connected by directed edges (routes), where the http://www.britannica.com/EBchecked/topic/603575/traveling-salesman-problem

document.write(''); Search Site: Advanced Search With all of these words With the exact phrase With any of these words Without these words Home SHOP BROWSE BLOG ... HELP Username: Password: Remember me Forgot your password? Help Email " is the e-mail address you used when you registered. Password " is case sensitive. If you need additional assistance, please contact customer support Enter the e-mail address you used when enrolling for Britannica Premium Service and we will e-mail your password to you. traveling-salesman-problem My Britannica CREATE MY traveling sa... NEW ARTICLE ... SAVE traveling salesman problem Table of Contents: traveling salesman problem Article Article Related Articles Related Articles Citations Article Related Articles Citations ARTICLE from the traveling salesman problem an optimization problem in graph theory in which the nodes (cities) of a graph are connected by directed edges (routes), where the weight of an edge indicates the distance between two cities. The problem is to find a path that visits each city once, returns to the starting city, and minimizes the distance traveled. The only known general solution algorithm that guarantees the shortest path requires a solution time that grows exponentially with the problem size (i.e., the number of cities). This is an example of an

60. IEEE Xplore - Dynamic Traveling Salesman Problem Based On by ZC Huang 2002 - Cited by 15 - Related articles http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=934338

Page 3     41-60 of 99    Back | 1  | 2  | 3  | 4  | 5  | Next 20