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 73    Back | 1  | 2  | 3  | 4  | 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. Re: Fastest Route Around The U.S.? - Rec.travel.usa-canada(307757)
    http//en.wikipedia.org/wiki/traveling_salesman_problem. It turns out to be a very tough problem, and for 50 states may be intractable.  
    http://www.national-anthems.net/forum/article/rec.travel.usa-canada/307757

42. Math Forum Discussions
    Salesman Problem (http//en.wikipedia.org/wiki/ traveling_salesman_problem). Matlab has a demo that solves this problem via heuristic procedures.  
    http://mathforum.org/kb/thread.jspa?threadID=1562421&messageID=5671762

43. Ksl.com - UPS Drivers Discouraged From Making Left Turns
    In fact, it is classified as NPhard (http//en.wikipedia. org/wiki/traveling_salesman_problem). I infer from the article that the UPS routing software  
    http://www.ksl.com/index.php?nid=148&sid=360685&comments=true

44. C++ Help [Archive] - Xtreme Visual Basic Talk
    mean the Traveling Salesman Problem. Not sure, since you said problem again, which is redundant. http//en.wikipedia.org/wiki/traveling_salesman_problem  
    http://www.xtremevbtalk.com/archive/index.php/t-261671.html
    
    Extractions: 05-07-2006, 07:13 PM tours, not tour. :p Help someone 05-07-2006, 07:14 PM Oh! Thanks! Why didn't I see that? Help someone 05-07-2006, 08:09 PM Do you have any advice on how to generate all the possible paths possible for a TSP problem? I would like to implement a function for the brute force attack on the TSP , that is, generate all the possible paths and then compute the length of each path and then choose the best one. 05-07-2006, 09:54 PM

45. CodeGuru Forums - TSP Algorithm For 1000 Cities
    Have you looked at this link (http//en.wikipedia.org/wiki/traveling_salesman_problem) ? It contains a handful of exact heuristic methods for the TSP  
    http://www.codeguru.com/forum/archive/index.php/t-413865.html

46. [QUIZ] Itinerary For A Traveling Salesman (#142) - ReadList.com
    http//en.wikipedia.org/wiki/traveling_salesman_problem http//en.wikipedia.org/wiki/Genetic_algorithm. PrevMsg, Prev-Thread. Home. Ruby-talk, Oct-2007  
    http://readlist.com/lists/ruby-lang.org/ruby-talk/18/91521.html
    
    Extractions: Prev-20 Home Next-20 3 msg ... finding obscure documentation [QUIZ] Itinerary for a Traveling Salesman (#142) Ruby Quiz (5 Oct 2007) Simon Kröger (6 Oct 2007) James Edward Gray II (6 Oct 2007) Morton Goldberg (6 Oct 2007) Eric Mahurin (6 Oct 2007) James Edward Gray II (6 Oct 2007) Morton Goldberg (7 Oct 2007) Dave Pederson (7 Oct 2007) James Edward Gray II (8 Oct 2007) Martin DeMello (8 Oct 2007) steve d (7 Oct 2007) James Edward Gray II (7 Oct 2007) James Koppel (7 Oct 2007) James Edward Gray II (7 Oct 2007) James Koppel (7 Oct 2007) Eugene Kalenkovich (8 Oct 2007) Joseph Seaton (8 Oct 2007) Eric I. (9 Oct 2007) Morton Goldberg (9 Oct 2007) steve (10 Oct 2007) James Edward Gray II (10 Oct 2007) Morton Goldberg (10 Oct 2007) Ruby Quiz (11 Oct 2007) 2 msg Sizeof(Object) 2 msg Mechanize click button ... Next-20 Prev-Msg Prev-Thread Home Ruby-talk Oct-2007 ... Next-Msg Subject: [QUIZ] Itinerary for a Traveling Salesman (#142) Group: Ruby-talk From: Ruby Quiz Date: 5 Oct 2007

47. The Chronicles Of George :: Search
    Being the IT department for a bunch of travelling salesmenYeah, but have you solved url=http//en.wikipedia.org/wiki/traveling_salesman_problemtheir  
    http://cog.nanc.com/board/search.php?search_author=dakboy&sid=1c76fb994ad971c41b

48. Groundspeak Forums [Powered By Invision Power Board]
    Generating a http//en.wikipedia.org/wiki/traveling_salesman_problem is complex math problem, and most software does not attempt it.  
    http://forums.groundspeak.com/GC/index.php?act=Print&client=printer&f=11&t=18008

49. Sci.math.research
    2=BDD _convex_hull/pseudotraveling_salesman_problem?=. From Olumide Date 4/14/2007 30010 PM. Hi - I d appreciate any suggestions or references on that  
    http://www.clubusenet.com/thread/5024381.html

50. Processing Blogs » 2008 » February
    Genetic Algorithm classes http//www.heatonresearch.com Travelling Salesman http//en.wikipedia.org/wiki/traveling_salesman_problem. Cast Ryan Bateman  
    http://www.processingblogs.org/2008/02/page/5/
    
    Extractions: Peter Kirn R.E.M., by Dunechaser . And Lego. There are some serious, high-profile indications that big artists are beginning to embrace alternative licensing for their content, whether it’s pay-what-you-wish distribution, “please remix this for us” marketing campaigns, or genuinely open content. Whether that’s just a brief fad or the sign of things to come, it’s too early to say. But R.E.M. have at least uploaded a full eleven videos, nicely encoded in MPEG4, under an open source license: Supernatural Serious Album Page, with vids R.E.M. Releases New Videos Under Open Source License [ReadWriteWeb, via vade] R.E.M. aside, I wonder: will at least some VJs embrace open content, perhaps even exclusively? Now, this isn’t without caveats:

51. Where Are You Based? - Page 28 - Cycle Chat
    I was just wondering (a bit geeky, I know) how bonj would solve the traveling salesman problem (http//en.wikipedia.org/wiki/traveling_salesman_problem)  
    http://www.cyclechat.co.uk/forums/showthread.php?p=176473

52. Path News.mathworks.com!newsfeed-00.mathworks.com!newsfeed2
    cycle with the smallest distance, you will need to solve the Traveling Salesman Problem (http//en.wikipedia.org/wiki/ traveling_salesman_problem).  
    http://www.mathworks.fr/matlabcentral/newsreader/view_original/369256
    
    Extractions: Path: news.mathworks.com!newsfeed-00.mathworks.com!newsfeed2.dallas1.level3.net!news.level3.com!postnews.google.com!b40g2000prd.googlegroups.com!not-for-mail From: "J.N." <joao.natali@gmail.com> Newsgroups: comp.soft-sys.matlab Subject: Re: Polygon drawing Date: 26 Apr 2007 08:54:27 -0700 Organization: http://groups.google.com Lines: 31 Message-ID: <1177602867.779659.84460@b40g2000prd.googlegroups.com> References: <ef54a49.-1@webcrossing.raydaftYaTP> NNTP-Posting-Host: 24.46.78.18 Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Trace: posting.google.com 1177602876 18804 127.0.0.1 (26 Apr 2007 15:54:36 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 26 Apr 2007 15:54:36 +0000 (UTC) In-Reply-To: <ef54a49.1@webcrossing.raydaftYaTP> User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.1.3) Gecko/20070309 Firefox/2.0.0.3,gzip(gfe),gzip(gfe) Complaints-To: groups-abuse@google.com Injection-Info: b40g2000prd.googlegroups.com; posting-host=24.46.78.18; Xref: news.mathworks.com comp.soft-sys.matlab:405419 On Apr 26, 2:54 am, Ash <ashp...@gmail.com> wrote: > thank you J.N > Tried what you suggested. > But seems only the first and last points join. > The rest is still a zig zag scan, the way MATLAB reads it > But i will try again > Thanks > > For instance, assuming n points. > > A = [ zeros(n-1,1) , eye(n-1) ; 1 , zeros(1,n-1) ] ; > > gplot(A,[x,y]) ; Hi, Ash, the code above assumes that the coordinate points are previously ordered (each point, or node, connects to the following one in the list). If that's not the case and you want to define the (non-crossing) cycle with the smallest distance, you will need to solve the Traveling Salesman Problem (http://en.wikipedia.org/wiki/ Traveling_salesman_problem). Matlab has a demo that solves this problem via heuristic procedures. Check http://www.mathworks.com/support/solutions/files/s37739/traveling_salesman_demoR13.m Regards, J.N.

53. PLZ HELP! Mathematics(TSP)!
    http//en.wikipedia.org/wiki/traveling_salesman_problem Last edited by checkmate on 16 Aug 2005 1900; edited 1 time in total  
    http://www.edaboard.com/ftopic129844.html

54. Re: A Possible "solution" To The Halting Problem
    The problem nomenclature is just the same as is used in the Travelling Salesman Problem. en.wikipedia.org/wiki/traveling_salesman_problem The halting  
    http://www.archivum.info/comp.theory/2006-10/msg00201.html
    
    Extractions: comp.theory Top All Lists Date Enter your search terms Submit search form Web www.archivum.info Thread from [ Alan Smaill Subject Re: A Possible "solution" to the Halting Problem From Date Wed, 18 Oct 2006 10:46:48 +0100 Newsgroups comp.theory sci.logic http://www.cprogramming.com/tutorial/computersciencetheory/halting.html Are you saying that the root cause of the "Problem" aspect of the "Halting Problem" has nothing to do with self-reference? The "problem" nomenclature is just the same as is used in the Travelling Salesman Problem. en.wikipedia.org/wiki/Traveling_salesman_problem The halting problem, just as with the TSP, is well-posed and unambiguous. Alan Smaill More with this subject... Current Thread Re: A Possible "solution" to the Halting Problem (continued) Re: A Possible "solution" to the Halting Problem Peter Olcott Re: A Possible "solution" to the Halting Problem Patricia Shanahan Re: A Possible "solution" to the Halting Problem

55. Traveling Salesman Problem
    en.wikipedia.org/wiki/traveling_salesman_problem. The traveling salesman problem or travelling salesman problem (TSP), also known as the traveling  
    http://www.edefinition.in/a/traveling salesman problem.html
    
    Extractions: satisfiability problem www.geocities.com/CapeCanaveral/1224/terms/esri_gloss.html This is a classic tour problem in which a hypothetical salesman must find the most efficient sequence of destinations in his territory, stopping only once at each. en.wikipedia.org/wiki/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. It is a prominent illustration of a class of problems in computational complexity theory which are hard to solve. www.esse.ou.edu/glossary_st.html A classic problem in operations research; the objective is to find the shortest path a "traveling salesman" could follow in order to visit each of a set of geographically distributed locations. Alpha numeric search: A B C D ... Z

56. Loading Several Hundred Addresses Into GPS
    http//en.wikipedia.org/wiki/traveling_salesman_problem I don t know of a GPS that can plan your trip, I m sorry. /Mogens  
    http://www.n-n-a.com/science/about2851.html

57. ID2401,visited_hrefs,5,d,25
    page 202 http//en.wikipedia.org/w/index.php?title=Optimal_routing_problem action= edit. page 203 http//en.wikipedia.org/wiki/traveling_salesman_problem  
    http://128.111.69.4/~jevbratt/infome_imager/lite/crawler_files/interface/display

58. Traveling Salesman Problem: ZIP-Method - Http://www.jochen-pleines.de/sprachen/e
    Sport Music Health Arts Computing House Games Economy Sexy Sport V1. audit et mesure d audience visiteurs internet par Analyse d audience  
    http://sciences.jdmag.net/dir/Math/Operations_Research/Traveling_Salesman_Proble

59. Issihk.com - Salesman
    en.wikipedia.org/wiki/traveling_salesman_problem 59k - Cached - Similar pages Sales - Wikipedia, the free encyclopedia forms a separate grouping in a  
    http://www.issihk.com/hot-products/salesman/

60. Search - Site - Jack Baskin School Of Engineering, UC Santa Cruz
    http//wikitrust.cse.ucsc.edu/index.php/traveling_salesman_problem kolaitis@cs.ucsc.edu (with C.H. Papadimitriou),. Journal of Computer and System Sci- .  
    http://www.soe.ucsc.edu/site/search.html?query=papadimitriou

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