Erdogan, Günes; Cordeau, Jean-François; Laporte, Gilbert - In: European Journal of Operational Research 203 (2010) 1, pp. 59-69
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed through an attraction function: every visited facility vertex attracts a...