A fast and effective heuristic for the orienteering problem

[1]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[2]  Rekha Sukumar Rilai.  The traveling salesman subset-tour problem with one additional constrait (TSSP+1) , 1995 .

[3]  M. Rosenwein,et al.  Strong linear programming relaxations for the orienteering problem , 1994 .

[4]  G. Dueck.  New optimization heuristics , 1993 .

[5]  Bruce L. Golden,et al.  Algorithms and solutions to multi-level vehicle routing problems , 1993 .

[6]  M. G. Kantor,et al.  The Orienteering Problem with Time Windows , 1992 .

[7]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[8]  Charles E. Noon,et al.  An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint , 1992 .

[9]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[10]  P. Sokkappa.  The cost-constrained traveling salesman problem , 1990 .

[11]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[12]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[13]  C. Keller.  Algorithms to solve the orienteering problem: A comparison , 1989 .

[14]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[15]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[16]  C. Keller.  Multiobjective Routing Through Space And Time: The Mvp And Tdvp Problems , 1985 .

[17]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[18]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[19]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[20]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .