1 |
Chao, I., B. Golden, and E. Wasil, "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research 88 (1996a), 475-489.
DOI
ScienceOn
|
2 |
Chao, I., B. Golden, and E. Wasil, "The team orienteering problem," European Journal of Operational Research 88 (1996b), 464-474.
DOI
ScienceOn
|
3 |
Fischetti, M., J. Salazar, and P. Toth, "Solving the orienteering problem through branch‐and‐cut," INFORMS Journal on Computing 10 (1998), 133-148.
DOI
ScienceOn
|
4 |
Gendreau, M., G. Laporte, and F. Semet, "A branch‐and‐cut algorithm for the undirected selective travelling salesman problem," Networks 32 (1998), 263-273.
DOI
ScienceOn
|
5 |
Golden, B., L. Levy, and R. Vohra, "The orienteering problem," Naval Research Logistics 34 (1987), 307-318.
DOI
|
6 |
Archetti, C., A. Hertz, and M. Speranza, "Metaheuristics for the team orienteering problem," Journal of Heuristics 13 (2007), 49-76.
DOI
ScienceOn
|
7 |
Ke, L., C. Archetti, and Z. Feng, "Ants can solve the team orienteering problem," Computers and Industrial Engineering 54 (2008), 648-665.
DOI
ScienceOn
|
8 |
Tsiligirides, T., "Heuristic methods applied to orienteering," Journal of the Operational Research Society 35 (1984), 797-809.
DOI
|
9 |
Vansteenwegen, P., W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden, "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research 196 (2009), 118-127.
DOI
ScienceOn
|
10 |
Hayes, M. and J. M. Norman, "Dynamic programming in orienteering: route choice and the siting of controls," Journal of the Operational Research Society 35 (1984), 791-796.
DOI
|
11 |
Laporte, G. and S. Martello, "The selective travelling salesman problem," Discrete Applied Mathematics 26 (1990), 193-207.
DOI
ScienceOn
|
12 |
Ramesh, R. and K. M. Brown, "An efficient four‐phase heuristic for the generalized orienteering problem," Computers and Operations Research 18 (1991), 151-165.
DOI
ScienceOn
|
13 |
Bouly, H., D.‐C. Dang, and A. Moukrim, "A memetic algorithm for the team orienteering problem," Lecture Notes in Computer Science 4974 (2008), 649-658.
|
14 |
Ramesh, R., Y. Yoon, and M. Karwan, "An optimal algorithm for the orienteering tour problem," ORSA Journal of Computing 4 (1992), 155-165.
DOI
|
15 |
Souffriau, W., P. Vansteenwegen, G. V. Berghe, and D. V. Oudheusden, "A path relinking approach for the team orienteering problem," Computers and Operations Research 37 (2010), 1853-1859.
DOI
ScienceOn
|
16 |
Tang, H. and E. Miller‐Hooks, "A tabu search heuristic for the team orienteering problem," Computer and Operations Research 32 (2005) 1379-1407.
DOI
ScienceOn
|
17 |
Boussier, S., D. Feillet, and M. Gendreau, "An exact algorithm for team orienteering problems," 4OR 5 (2007), 211-230.
DOI
ScienceOn
|
18 |
Butt, S. and T. Cavalier, "A heuristic for the multiple tour maximum collection problem," Computers and Operations Research 21 (1994), 101-111.
DOI
ScienceOn
|