<html><head></head><body><div style="font-family: Verdana;font-size: 12.0px;"><div>Hi all,</div>
<div> </div>
<div>maybe someone of you can point me in the right direction.</div>
<div> </div>
<div>I have an incomplete Graph for which I want a TSP solution.</div>
<div>What I did so far:</div>
<div>1. Convert the graph to be complete<br/>
For this I calculate the distance between nodes not having an edge jet, using dijkstra.<br/>
Than I add a new edge with this length.</div>
<div>2. Set the distance between start end end node to be zero</div>
<div>3. Run the TSP algorithm</div>
<div> </div>
<div>Issue: The TSP is solved but start and end point are never visited one directly after another.</div>
<div> </div>
<div>Is this possible at all? I even tried to add a negative distance to the edge between start and end point.</div>
<div>Interestingly here I get a negative length of the route even this edge is not used.</div>
<div> </div>
<div>Regards,</div>
<div> </div>
<div>Thomas</div>
<div> </div></div></body></html>