Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting a simple circuit of maximal total profit, whose length does not exceed a prespecified bound. This paper provides integer linear programming formulations for the problem. Upper and lower bounds are then derived and embedded in exact enumerative algorithms. Computational results are reported. © 1990.
Laporte, G., & Martello, S. (1990). The selective travelling salesman problem. Discrete Applied Mathematics, 26(2–3), 193–207. https://doi.org/10.1016/0166-218X(90)90100-Q