A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem

References

• Ávila T, Corberán A, Plana I, Sanchis JM (2015) The stacker crane problem and the directed general routing problem. Networks 65:43–55.Crossref, Google Scholar
• Balas E, Ng M (1989) On the set covering polytope I: All the facets with coefficients in {0, 1, 2}. Math. Programming 43:57–69.Crossref, Google Scholar
• Corberán A, Sanchis JM (1994) A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. 79:95–114.Crossref, Google Scholar
• Corberán A, Mejía G, Sanchis JM (2005) New results on the mixed general routing problem. Oper. Res. 53:363–376.Link, Google Scholar
• Corberán A, Mota E, Sanchis JM (2006) A comparison of two different formulations for arc routing problems on mixed graphs. Comput. Oper. Res. 33:3384–3402.Crossref, Google Scholar
• Corberán A, Plana I, Sanchis JM (2007) A branch and cut algorithm for the windy general routing problem and special cases. Networks 49:245–257.Crossref, Google Scholar
• Drexl M (2007) On some generalized routing problems. Unpublished doctoral dissertation, Rheinisch-Westfälische Technische Hochschule, Aachen University, Aachen, Germany.Google Scholar
• Drexl M (2014) On the generalized directed rural postman problem. J. Oper. Res. Soc. 65:1143–1154.Crossref, Google Scholar
• Hà M-H, Bostel N, Langevin A, Rousseau L-M (2012) An exact algorithm for close enough traveling salesman problem. Luz C-J, Valente F, eds. Proc. 1st Internat. Conf. Oper. Res. Enterprise Systems, ICORES 2012 (SciTePress, Vilamoura, Algarve, Portugal), 233–238.Google Scholar
• Hà M-H, Bostel N, Langevin A, Rousseau L-M (2014) Solving the close enough arc routing problem. Networks 63:107–118.Crossref, Google Scholar
• Shuttleworth R, Golden B, Smith S, Wasil E (2008) Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, Berlin), 487–501.Crossref, Google Scholar