1

I'm looking for a pseudocode for B&B algorithm for Travelling Salesman problem. I found this: TSP - Branch and bound but links that somebody gave there as an answer didn't help me so far. Do you have any examples os that pseudocode?

Thank you in advance!

Community
  • 1
  • 1
user3448282
  • 2,629
  • 3
  • 25
  • 47
  • There are several different B&B algorithms for TSP. Do you mean the approach that doesn't use linear programming (LP) at all but is based on row/column reductions (Little et al. 1963)? Or methods involving taking the LP relaxation and then possibly adding cuts (there are many such methods)? – LarrySnyder610 Oct 27 '14 at 11:57
  • I meant Little algorithm, but I found it already, but thanks for respond :) – user3448282 Oct 28 '14 at 08:34
  • Would it be possible to include where did you find it? – BraveDistribution Feb 11 '19 at 15:47

0 Answers0