Home  - Theorems_And_Conjectures - Traveling Salesman Problem

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

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

Traveling Salesman Problem:     more books (18)

The Traveling Salesman Problem and Its Variations (Combinatorial Optimization) The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) by David L. Applegate, Robert E. Bixby, et all 2007-01-15 The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization) by E. L. Lawler, Jan Karel Lenstra, et all 1985-09 Simulated Annealing und verwandte Verfahren für das Traveling Salesman Problem: Zur Studie gehört Software, die nur in digitaler Form (CD oder Download) erhältlich ist. (German Edition) by Andy Ruigies, 1995-01-01 Effiziente Heuristiken Fur Das Probabilistische Traveling Salesman Problem by Silke Rosenow, 2002-04 Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem [An article from: European Journal of Operational Research] by L. Bianchi, A.M. Campbell, 2007-01-01 Lösungsverfahren für das 2-dimensionale, euklidische Traveling Salesman Problem unter besonderer Berücksichtigung der Delaunay-Triangulation by Silvia Annette Schiemann, 2005-01-30 The traveling salesman problem as a benchmark test for a Social-Based Genetic Algorithm.(Technical report): An article from: Journal of Computer Science by Nagham Azmi al- Madi, Ahamad Tajudin Khader, 2008-10-01 Self-Optimizing Stochastic Systems: Applications To Stochastic Shortest Path Problem, Stochastic Traveling Salesman Problem, and Queueing by Thusitha Sen Jayawardena, 1990 Aggregation for the probabilistic traveling salesman problem [An article from: Computers and Operations Research] by A.M. Campbell, 2006-09-01 Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms [An article from: European Journal of Operational Research] by L. Bianchi, J. Knowles, et all 2005-04-01 Data structures and ejection chains for solving large-scale traveling salesman problems [An article from: European Journal of Operational Research] by D. Gamboa, C. Rego, et all 2005-01-01 A hybrid scatter search for the probabilistic traveling salesman problem [An article from: Computers and Operations Research] by Y.-H. Liu, 2007-08-01 Implementation analysis of efficient heuristic algorithms for the traveling salesman problem [An article from: Computers and Operations Research] by D. Gamboa, C. Rego, et all 2006-04-01

lists with details

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
    
    Extractions: 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 Namespaces Variants Views Actions Search Navigation Interaction Toolbox Print/export 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/

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
    
    Extractions: Home Bookmarks Search (Re)search ... Papers Applet By Kreimer Natasha. 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
    
    Extractions: Daniel Karapetyan what is this? 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

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
    
    Extractions: 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 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)

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
    
    Extractions: document.write(''); Search Site: With all of these words With the exact phrase With any of these words Without these words Home My Britannica CREATE MY traveling sa... NEW ARTICLE ... SAVE Table of Contents: traveling salesman problem Article Article Related Articles 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

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