SEARCH

SEARCH BY CITATION

References

  • 1
    N. Christofides, V. Campos, A. Corberán, and E. Mota, An algorithm for the rural postman problem on a directed graph, Math Program Stud 26 (1986), 155166.
  • 2
    M.O. Ball and M.J. Magazine, Sequencing of insertions in printed circuit board assembly, Oper Res 36 (1988), 192201.
  • 3
    V. Campos and J.V. Savall, A computational study of several heuristics for the directed rural postman problem, Comput Optim Appl 4 (1993), 6777.
  • 4
    B. Golden, S. Raghavan, and E. Wasil, “Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network,” The vehicle routing problem: Lastest avances and new challenges, Springer-Verlag, Berlin, 2008, pp. 487501.
  • 5
    M-H. Ha, N. Bostel, A. Langevin, and L-M. Rouseau, “An exact algorithm for close enough traveling salesman problem,” Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, C-J. Luz and F. Valente (Editors), Vilamoura, Algarve, Portugal, February 2012, pp. 233238, SciTePress 2012 ISBN 978-989-8425-97-3.
  • 6
    M. Drexl, On some generalized routing problems. Ph.D. dissertation, Rheinisch-Westfalishe Technische Hochschule Aachen, Aachen, Germany, 2003.
  • 7
    M. Gendreau, G. Laporte, and F. Semet, The covering tour problem, Oper Res 45 (1997), 568576.
  • 8
    R. Baldacci, M.A. Boschetti, V. Maniezzo, and M. Zamboni, “Scatter search methods for covering tour problem,” Metaheuristic optimization via memory and evolution, R. Sharda, S. Voss, C. Rego, and B. Alidaee (Editors), Springer Verlag, Berlin, 2005, pp. 5591.
  • 9
    M. Hachicha, M.J. Hodgson, G. Laporte, and F. Semet, Heuristics for the multi-vehicle covering tour problem, Comput Oper Res 27 (2000), 2942.
  • 10
    D. Gulczynski, J. Heath, and C. Price, “The close enough traveling salesman problem: A discussion of several heuristics,” Perspectives in operations research: Papers in honor of saul Gass' 80th birthday, F. Alt, M. Fu, and B. Golden (Editors), Springer Verlag, Berlin, 2006, pp. 271283.
  • 11
    J. Dong, N. Yang, and M. Chen, “Heuristic approaches for a tsp variant: The automatic meter reading shortest tour problem,” Extending the horizons: Advances in computing, optimisation, and decision technologies, E. Baker, A. Joseph, A. Medrotra, and M. Trick (Editors), Springer Verlag, Berlin, 2007, pp. 145163.
  • 12
    E. Balas and S.M. Ng, On the set covering polytope: All the facets with coefficients in 0, 1, 2, Math Program 43 (1986), 5769.
  • 13
    M. Sánchez-García, M.I. Sobrón, and B. Vitoriano, On the set covering polytope: Facets with coefficients in {0, 1, 2, 3}, Ann Oper Res 81 (1998), 343356.
  • 14
    A. Corberán, E. Mota, and J.M. Sanchis, A comparison of two different formulations for arc routing problems on mixed graphs, Comput Oper Res 33 (2006), 33843402.
  • 15
    A. Corberán, A.N. Letchford, and J.M. Sanchis, A cutting plane algorithm for the general routing problem, Math Program 90 (2001), 291316.
  • 16
    E. Benavent, A. Carrotta, A. Corberán, J.M. Sanchis, and D. Vigo, Lower bounds and heuristics for the windy rural postman problem, Eur J Oper Res (2007), 855869.
  • 17
    G. Ghiani and G. Laporte, A branch-and-cut algorithm for the undirected rural postman problem, Math Program 87 (2000), 467481.