Local search for the probabilistic traveling salesman problem: a proof of the incorrectness of Bertsimas' proposed 2-p-opt and 1-shift algorithms.

Bianchi, Leonora and Knowles, Joshua (2002) Local search for the probabilistic traveling salesman problem: a proof of the incorrectness of Bertsimas' proposed 2-p-opt and 1-shift algorithms. Technical Report. UNSPECIFIED.

[img] Text
IDSIA-21-02.pdf

Download (168Kb)

Actions (login required)

View Item View Item