Oxford Index Search Results

You are looking at 1-20 of 48 items for:

travelling salesman problem x clear all

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

See overview in Oxford Index

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

See overview in Oxford Index

travelling salesman problem

Edited by Andrew Butterfield, Gerard Ekembe Ngondi and Anne Kerr.

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

Go to Oxford Reference »  home page

Using traveling salesman problem algorithms for evolutionary tree construction

Chantal Korostensky and Gaston H. Gonnet.

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

Go to Oxford Journals »  abstract

traveling salesman problem

John Daintith and Edmund Wright.

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

Go to Oxford Reference »  home page

travelling salesman problem n.

Andrew M. Colman.

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

Go to Oxford Reference »  home page

travelling salesman problem n.

Andrew M. Colman.

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

Go to Oxford Reference »  home page

travelling salesman problem

Graham Upton and Ian Cook.

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

Go to Oxford Reference »  home page

travelling salesman problem

Graham Upton and Ian Cook.

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

Go to Oxford Reference »  home page

travelling salesman problem (in graph theory)

Christopher Clapham and James Nicholson.

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

Go to Oxford Reference »  home page

travelling salesman problem ((in graph theory))

Christopher Clapham and James Nicholson.

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

Go to Oxford Reference »  home page

TSP

Overview page. Subjects: Computing.

Abbrev. for traveling salesman problem.

See overview in Oxford Index

TSP

Edited by Andrew Butterfield, Gerard Ekembe Ngondi and Anne Kerr.

in A Dictionary of Computer Science

January 2016; p ublished online January 2016 .

Reference Entry. Subjects: Computing. 6 words.

Abbrev. for travelling salesman problem.

Go to Oxford Reference »  home page

TSP

John Daintith and Edmund Wright.

in A Dictionary of Computing

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 6 words.

Abbrev. for traveling salesman problem.

Go to Oxford Reference »  home page

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.

See overview in Oxford Index

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

See overview in Oxford Index

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

See overview in Oxford Index

The bridges of Königsberg

Iwo Białynicki-Birula and Iwona Białynicka-Birula.

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

Go to Oxford Scholarship Online »  abstract

The Golden Ticket

Lance Fortnow.

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

Go to Princeton University Press »  abstract

Four types of problem

Robin Wilson.

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

Go to Very Short Introductions »  abstract

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

See overview in Oxford Index