0
$\begingroup$

I am wondering what is the difference between Bottleneck Travelling Salesman Problem and normal Travelling Salesman Problem?

Thank you

$\endgroup$
  • 2
    $\begingroup$ Is there something wrong with the explanation in wikipedia? $\endgroup$ – Karolis Juodelė Mar 8 '14 at 20:13
  • $\begingroup$ I just don't get it well. That is why I asked. It says "discrete or combinatorial optimization". $\endgroup$ – Güngör Basa Mar 8 '14 at 20:21
  • $\begingroup$ I am actually trying to find a good heuristic algorithm for solving 2d plain(coordinate system) traveling salesman problem. $\endgroup$ – Güngör Basa Mar 8 '14 at 20:22
2
$\begingroup$

BTSP asks to find a Hamiltonian cycle in a weighted graph, which minimizes the weight of its most weighty edge.

TSP asks to find a Hamiltonian cycle in a weighted graph, which minimizes the sum of weights of its edges.

| cite | improve this answer | |
$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.