Algebraic.net

Home  - Theorems_And_Conjectures - Traveling Salesman Problem

Books Popular Music Classical Music DVD VHS Toys Baby Computers Video Games Electronics Camera & Photo Software Tools & Hardware Office Products Magazines Outdoor Living Kitchen Travel Cell Phones & Service

Images

Newsgroups

81-93 of 93    Back | 1  | 2  | 3  | 4  | 5

Traveling Salesman Problem:

The Traveling Salesman Problem : A Guided Tour of Combinatorial Optimization by E. L. Lawler, Jan Karel Lenstra, et all September, 1985 Traveling Salesman Problem and Its Variations (Combinatorial Optimization, V. 12) by Gregory Gutin, Abraham P. Punnen, May, 2002 Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme by Martin Grötschel, The Traveling Salesman: Computational Solutions for Tsp Applications (Lecture Notes in Computer Science, Vol 840) by Gerhard Reinelt, August, 1994 Das quadratische Zuweisungsproblem und zwei seiner Spezialfälle by Klaus Conrad, Effiziente Heuristiken Fur Das Probabilistische Traveling Salesman Problem by Silke Rosenow, April, 2002 Subtour-Eliminations-Verfahren zur Lösung asymmetrischer Routing-Probleme by Joachim Pautsch, Tourenplanung für die Entleerung von Bringsystemen zur Wertstoffsammlung in Stadtgebieten by Jochen Schübbe, Die Tourenkonstruktion bei heterogenem Fuhrpark by Johannes Elchner, Ansätze künstlicher neuronaler Netze zur Lösung von Tourenplanungsproblemen by Robert Mundigl,

81. CyberSpace Search!
    SEARCH THE WEB. Results 1 through 9 of 9 for traveling salesman problem.  
    http://www.cyberspace.com/cgi-bin/cs_search.cgi?Terms=traveling salesman problem

82. NEAREST MERGER TRAVELING SALESMAN PROBLEM
    NEAREST MERGER traveling salesman problem. INSTANCE A distance matrix , whereis an integer or the symbol specifying the distance between vertices i and j.  
    http://www.i.kyushu-u.ac.jp/~shoudai/P-complete/all/node56.html

83. Traveling-Salesman-Problem
    Translate this page Das traveling-salesman-problem (TSP) gilt als eines der klassischen kombinatorischenprobleme. Optimale Lösungen für TSP mit großer  
    http://jochen.pleines.bei.t-online.de/german/1_tsp.htm

84. Travelling Salesman Problem From FOLDOC
    travelling salesman problem. algorithm, complexity (TSP or shortest path , US traveling ) Given a set of towns and the distances between them, determine  
    http://wombat.doc.ic.ac.uk/foldoc/foldoc.cgi?travelling salesman problem

85. Traveling Salesman
    NIST. traveling salesman. (classic problem). Definition Find a paththrough a weighted graph which starts and ends at the same vertex  
    http://www.nist.gov/dads/HTML/travelingSalesman.html

86. Traveling Salesman Heuristics
    Welcome. This applet implements some simple, but effective heuristics for the TravelingSalesman problem with Euclidian distances ie in a 2D plane. Directions.  
    http://riot.ieor.berkeley.edu/~cander/cs270/

87. KVV / Das Traveling-Salesman-Problem
    Translate this page Kommentiertes Vorlesungsverzeichnis Vorlesung. Das traveling-salesman-problem.Dr. J. Vygen. Beschreibung. Gegenstand dieser zweistündigen  
    http://www.informatik.uni-bonn.de/kvv/ws0203/ver85.html

88. Travelling Salesman Problem
    GUEST BOOK Visitors since 10.06.97 Elastic Net Method for the Travellingsalesman problem. If THE TRAVELLING salesman problem If  
    http://nuweb.jinr.dubna.su/~filipova/tsp.html

89. The Travelling Salesman Problem
    Caveat This has been very much an occasional hobby over recent years, and I have not had the time to keep abreast of the literature. Some of what I say might be out of date. The Travelling salesman problem (TSP) is a deceptively simple combinatorial problem. A salesman spends his time visiting n cities (or 2 cities then the problem is trivial, since only  
    http://www.pcug.org.au/~dakin/tsp.htm

90. Travelling Salesman Problem
    Travelling salesman problem. CLICK inside to stop; CLICK again to resetand start. Left Side Legend Red path should be the shortest  
    http://www.patol.com/java/TSP/

91. 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/

92. The Travelling Salesman Problem
    So far, nobody was able to come up with an algorithm for solving the travelingsalesman problem that does not show an exponential growth of run time with a  
    http://www.uni-kl.de/AG-AvenhausMadlener/tsp-eng.html

93. Cybercity
    efsa118, Erhverv Cybercity har et stort og varieret udbud af løsninger.Find den rette til netop din virksomhed. Privat Hos Cybercity Category World Dansk Edb Internet Internet Service Udbydere  
    http://www.cybercity.dk/

81-93 of 93    Back | 1  | 2  | 3  | 4  | 5

contact: support@algebraic.net