## travelling salesman problem

Overview page. Subjects: Mathematics — Psychology.

A network problem that can be formulated as a combinatorial optimization problem. A salesman has to visit a number of interconnected destinations. The problem is to determine the route that...

## travelling salesman problem

Overview page. Subjects: Mathematics — Psychology.

A network problem that can be formulated as a combinatorial optimization problem. A salesman has to visit a number of interconnected destinations. The problem is to determine the route that...

## travelling salesman problem

in** A Dictionary of Computer Science**

January 2016; p ublished online January 2016 .

Reference Entry. Subjects: Computing. 81 words.

A well-known *graph searching problem. In practical terms the problem can be thought of as that of a salesman who wishes to perform a circular tour of certain cities, calling at each city...

## Using traveling salesman problem algorithms for evolutionary tree construction

in** Bioinformatics**

July 2000; p ublished online July 2000 .

Journal Article. Subjects: Bioinformatics and Computational Biology. 0 words.

Motivation: The construction of evolutionary trees is one of the major problems in computational biology, mainly due to its complexity.

Results: We present a new tree...

## traveling salesman problem

in** A Dictionary of Computing**

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 74 words.

A well-known *graph-searching problem. In practical terms the problem can be thought of as that of a salesman who

##
travelling salesman problem *n.*

in** A Dictionary of Psychology**

January 2008; p ublished online January 2009 .

Reference Entry. Subjects: Psychology. 277 words.

The problem of finding the shortest path that passes through a given set of points once and only once, as

##
travelling salesman problem *n.*

in** A Dictionary of Psychology**

January 2015; p ublished online May 2015 .

Reference Entry. Subjects: Psychology. 277 words.

The problem of finding the shortest path that passes through a given set of points once and only once, as

## travelling salesman problem

in** A Dictionary of Statistics**

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Probability and Statistics. 57 words.

A *network problem that can be formulated as a *combinatorial optimization problem. A salesman has to visit a

## travelling salesman problem

in** A Dictionary of Statistics**

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Probability and Statistics. 57 words.

A *network problem that can be formulated as a *combinatorial optimization problem. A salesman has to visit a number of interconnected destinations. The problem is to determine the route...

## travelling salesman problem (in graph theory)

in** The Concise Oxford Dictionary of Mathematics**

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 235 words.

This is a situation similar to the *minimum connector problem but the salesman wishes to return to the starting

## travelling salesman problem ((in graph theory))

in** The Concise Oxford Dictionary of Mathematics**

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 241 words.

This is a situation similar to the *minimum connector problem but the salesman wishes to return to the starting point (home) at the end, and so essentially the problem is to find a closed...

## TSP

in** A Dictionary of Computer Science**

January 2016; p ublished online January 2016 .

Reference Entry. Subjects: Computing. 6 words.

*Abbrev. for* travelling salesman problem.

## TSP

in** A Dictionary of Computing**

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 6 words.

*Abbrev. for* traveling salesman problem.

## combinatorial optimization

Overview page. Subjects: Probability and Statistics.

An optimization technique in which the values of the variables are restricted to integers. Examples include the knapsack and travelling salesman problems.

## network

Overview page. Subjects: Probability and Statistics.

A graphical representation of a problem by means of nodes connected by arcs of varying length or capacity. The arcs are usually directed. Examples include finding the shortest path between...

## brute force algorithm

Overview page. Subjects: Psychology.

A method of problem solving in which every possibility is examined and the best one (or a best one) is chosen. It is often implemented by computers, but it cannot be used to solve complex...

## The bridges of Königsberg

in** Modeling Reality**

October 2004; p ublished online January 2010 .

Chapter. Subjects: Mathematical and Statistical Physics. 3458 words.

A simple idea of drawing crude sketches made of line segments to visualize the solutions of some problems has developed over the years into a sophisticated branch of mathematics: graph...

## The Golden Ticket

in** The Golden Ticket**

February 2017; p ublished online May 2018 .

Chapter. Subjects: Programming Languages. 3181 words.

This introductory chapter provides an overview of the P versus NP problem. The P versus NP problem asks, among other things, whether one can quickly find the shortest route for a traveling...

## Four types of problem

in** Combinatorics**

April 2016; p ublished online April 2016 .

Chapter. Subjects: Combinatorics and Graph Theory. 4171 words.

‘Four types of problem’ explains that combinatorics is concerned with four types of problem: existence problems (does x exist?); construction problems (if x exists, how can we construct...

## problem solving

Overview page. Subjects: Psychology.

Cognitive processing directed at finding solutions to well-defined problems, such as the Tower of Hanoi, Wason selection task, or a water-jar problem, by performing a sequence of...