TSP - Branch and bound

Question

I\'m trying to solve the TSP with Branch and bound algorithm.

I must build a matrix with costs but I have this problem: I have city with coordinates x and y.

Answer 1

Step by step explanation of branch and bound method:

• video: https://www.youtube.com/watch?v=RR7GXoWiUw4
• book: https://archive.org/details/algorithmfortrav00litt (link to download in pdf)
• implementation (C++): https://github.com/karepker/little-tsp

I hope my answer will be useful for somebody.

Answer 2

Here you go: http://lcm.csa.iisc.ernet.in/dsa/node187.html - it seems to explain fairly well how this should be approached.

Archive.org link

Answer 3

This PDF document gives a more detailed explanation of the Branch and Bound implementation for the Traveling Salesperson Problem:

Part 1: A solution with nodes containing partial tours with constraints http://www.jot.fm/issues/issue_2003_03/column7.pdf

Part 2 PDF can also be found. http://www.jot.fm/issues/issue_2003_05/column7/