You are looking at 1-1 of 1 entries  for:

  • All: 7‐20‐8 x
clear all

View:

Overview

7-20-8

(1907), a “comedy of to‐day” by Augustin Daly. [Daly's Theatre, 49 perf.] Portrait of a Lady, picture #728 at the annual Academy exhibition, so lovingly depicts a beautiful woman ...

travelling salesman problem

travelling salesman problem n.   Quick reference

A Dictionary of Psychology (4 ed.)

Reference type:
Subject Reference
Current Version:
2015

...there are 10 × 9 = 90 different ways in which the tour can begin with the first two cities, and for each of these there are eight possibilities left for the third visit, and so on, the total number of tours through the ten cities therefore being 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 3,628,800 tours. For 20 cities, the number of possible tours is 2,432,902,008,176,640,000, and for 30 cities it exceeds 265 thousand billion billion billion. Even the world’s fastest supercomputer would take many billions of years to solve the travelling salesman problem for a...

View: