The selective travelling salesman problem

0Citations
Citations of this article
103Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free