Lecture 6 - Travelling Salesman Problem Flashcards by michal wozniak | Brainscape

Q

What is the travelling salesman problem?

A

is there a permutation of cities that has a distance smaller than K

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is the distance path called?

A

travelling salesman tour

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Is this problem NP-Complete?

A

YES

How well did you know this?

1

Not at all

2

3

4

5

Perfectly