Recent results on arc routing problems: An annotated bibliography

Networks

Volumn 56, Issue 1, 2010, Pages 50-69

  Corbeŕn, Angel ^a   Prins, Christian ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Arc routing; Transportation; Vehicle routing

Indexed keywords

ARC ROUTING; ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; CHINESE POSTMAN PROBLEM; GENERAL ROUTING PROBLEM; MULTI-VEHICLES; ROUTING PROBLEMS; RURAL POSTMAN PROBLEM; TRANSPORTATION VEHICLES; VEHICLE ROUTING PROBLEMS;

BIBLIOGRAPHIES; ROADS AND STREETS; SURVEYS;

VEHICLES;

EID: 77955444898     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20347     Document Type: Article

References (150)

1. D. Ahr, Contributions to multiple postmen problems, PhD Thesis, University of Heidelberg, 2004.
2. D. Ahr and G. Reinelt, "New heuristics and lower bounds for the min-max k-Chinese Postman Problem," Algorithms - ESA 2002, R. Möhring and R. Raman (Editors), Lecture Notes in Computer Science 2461, Springer, 2002, pp. 64-74.
3. D. Ahr and G. Reinelt, A tabu search algorithm for the min-max k-Chinese postman problem, Comput Oper Res 33 (2006), 3403-3422.
4. A. Amaya, A. Langevin, and M. Trépanier, The capacitated arc routing problem with refill points, Oper Res Let 35 (2007), 45-53.
5. A. Amberg, W. Domschke, and S. Voss, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Eur J Oper Res 124 (2000), 360-376.
6. A. Amberg and S. Voss, "A hierarchical relaxations lower bound for the capacitated arc routing problem," Proceedings of the 35th Annual Hawaii International Conference on System Sciences, R.H. Sprague (Editor), Vol.3, 2002, pp. 1-10.
7. U.F. Aminu and R.W. Eglese, A constraint programming approach to the Chinese postman problem with time windows, Comput Oper Res 33 (2006), 3423-3431.
8. S.K. Amponsah and S. Salhi, The investigation of a class of capacitated arc routing problems: The collection of garbage in developing countries,Waste Manage 24 (2004), 711-721.
9. J. Aráoz, E. Fernández, and O. Meza, Solving the prizecollecting rural postman problem, Eur J Oper Res 196 (2009), 886-896.
10. J. Aráoz, E. Fernández, and C. Zoltan, Privatized rural postman problems, Comput Oper Res 33 (2006), 3432-3449.
11. A. Assad, Leonhard Euler: A brief appreciation, Networks 49 (2007), 190-198.
12. A. Assad and B. Golden, "Arc routing methods and applications," Network Routing, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhausser (Editors), Handbooks of Operations Research and Management Science 8, North Holland, 1995.
13. F. Barahona and M. Grötschel, On the cycle polytope of a binary matroid, J Combinatorial Theory 40 (1986), 40-62.
14. R. Baldacci andV. Maniezzo, Exact methods based on noderouting formulations for undirected arc routing problems, Networks 47 (2006), 52-60.
15. J. Bautista, E. Fernández, and J. Pereira, Solving an urban waste collection problem using ants heuristics, Comput Oper Res 35 (2008), 3020-3033.
16. J.E. Beasley, Route-first cluster-second methods for vehicle routing, Omega 11 (1983), 403-408.
17. J.M. Belenguer and E. Benavent, Polyhedral results on the capacitated arc routing problem, Technical Report TR01- 1992, University of Valencia, Spain, 1992.
18. J.M. Belenguer and E. Benavent, A branch and cut algorithm for the Capacitated Arc Routing Problem, Workshop on Algorithmic Approaches to Large and Complex Combinatorial Optimization Problems, Giens, France, 1994.
19. J.M. Belenguer and E. Benavent, The capacitated arc routing problem: Valid inequalities and facets, Computational Optimization Applications 10 (1998), 165-187.
20. J.M. Belenguer and E. Benavent, A cutting plane algorithm for the capacitated arc routing problem, Comput Oper Res 30 (2003), 705-728.
21. J.M. Belenguer, E. Benavent, P. Lacomme, and C. Prins, Lower and upper bounds for the mixed capacitated arc routing problem, Comput Oper Res 33 (2006), 3363-3383.
22. J.M. Belenguer, Benavent, N. Labadi, C. Prins, and M. Reghioui, Split delivery capacitated arc routing problem: Lower bound and metaheuristic, Technical Report, University of Technology of Troyes, France, 2008.
23. E. Benavent, V. Campos, A. Corberán, and E. Mota, Problemas de rutas por arcos, Questiió 7 (1983), 479-490.
24. 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 176 (2007), 855-869.
25. E. Benavent, A. Corberán, E. Piñana, I. Plana, and J.M. Sanchis, New heuristic algorithms for the windy rural postman problem, Comput Oper Res 32 (2005), 3111-3128.
26. E. Benavent, A. Corberán, I. Plana, and J.M. Sanchis, The min-max K-vehicles windy rural postman problem, Networks (2009), DOI: 10.1002/net20334.
27. E. Benavent, A. Corberán, and J.M. Sanchis, "Linear programming based methods for solving arc routing problems," Arc Routing: Theory, Solutions and Applications, M. Dror (Editor), Kluwer Academic Publishers, 2000.
28. E. Benavent and D. Soler, The directed rural postman problem with turn penalties, Transport Sci 33 (1999), 408-418.
29. P. Beullens, L. Muyldermans, D. Cattrysse, and D.Van Oudheusden, A guided local search heuristic for the capacitated arc routing problem, Eur J Oper Res 147 (2003), 629-643.
30. M. Blais and G. Laporte, Exact solution of the generalized routing problem through graph transformations, J Oper Res Soc 54 (2003), 906-910.
31. L. Bodin, B. Golden, A. Assad, and M. Ball, Routing and scheduling of vehicles and crews, Comput Oper Res 10 (1983), 63-211.
32. J. Brandão and R. Eglese, A deterministic tabu search algorithm for the capacitated arc routing problem, Comput Oper Res 35 (2008), 1112-1126. (Pubitemid 47558960)
33. P. Breslin and A. Keane, The capacitated arc routing problem: Lower bounds, Master's Thesis, University College Dublin, 1997.
34. E. Cabral, M. Gendreau, G. Ghiani, and G. Laporte, Solving the hierarchical chinese postman problem as a rural postman problem, Eur J Oper Res 155 (2004), 44-50.
35. A. Caprara and M. Fischetti, 0-1/2 Chvatal-Gomory Cuts, Mathe Program 74 (1996), 221-235.
36. A. Caprara, M. Fischetti, and A.N. Letchford, On the separation of maximally violated mod-k cuts, Mathe Program 87 (2000), 37-56.
37. N. Christofides, The optimum traversal of a graph, Omega 1 (1973), 719-732.
38. F. Chu, N. Labadi, and C. Prins, Heuristics for the periodic capacitated arc routing problem, J Intelligent Manufact 16 (2005), 243-251. (Pubitemid 40536255)
39. F. Chu, N. Labadi, and C. Prins, A scatter search for the periodic capacitated arc routing problem, Eur J Oper Res 169 (2006), 586-605.
40. C.C. Chyu, A mixed strategy heuristic for the mixed arc routing problem, J Chin Inst Indust Eng 18 (2001), 68-76.
41. J. Clossey, G. Laporte, and P. Soriano, Solving arc routing problems with turn penalties, J Oper Res Soc 52 (2001), 433-439.
42. A. Corberán, A. Letchford, and J.M. Sanchis, A cutting plane algorithm for the general routing problem, Math Program 90 (2001), 291-316.
43. A. Corberán, R. Martí, E. Martínez, and D. Soler, The rural postman problem on mixed graphs with turn penalties, Comput Oper Res 29 (2002), 887-903.
44. A. Corberán, R. Martí, and A. Romero, Heuristics for the mixed rural postman problem, Comput Oper Res 27 (2000), 183-203.
45. A. Corberán, R. Martí, and J.M. Sanchis, A GRASP procedure for the mixed chinese postman problem, Eur J Oper Res 142 (2002), 70-80. (Pubitemid 35171679)
46. A. Corberán, G. Mejía, and J.M. Sanchis, New results on the mixed general routing problem, Oper Res 53 (2005), 363-376.
47. 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), 3384-3402.
48. A. Corberán, M. Oswald, I. Plana, G. Reinelt, and J.M. Sanchis, New results on the windy postman problem, Technical Report TR05-2007, University of Valencia, Spain, 2007.
49. A. Corberán, I. Plana, and J.M. Sanchis, Zigzag inequalities: A new class of facet-inducing inequalities for arc routing problems, Math Program 108 (2006), 79-96.
50. A. Corberán, I. Plana, and J.M. Sanchis, A branch and cut algorithm for the windy general routing problem and special cases, Networks 49 (2007), 245-257.
51. A. Corberán, I. Plana, and J.M. Sanchis, The windy general routing polyhedron: A global view of many known arc routing polyhedra, SIAM J Discrete Math 22 (2008), 606-628.
52. A. Corberán, A. Romero, and J.M. Sanchis, The mixed general routing polyhedron, Math Program 96 (2003), 103-137.
53. G. Cornuéjols, J. Fonlupt, and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Math Program 33 (1985), 1-27.
54. De Rosa, G. Improta, G. Ghiani, and R. Musmanno, The arc routing and scheduling problem with transhipment, Transport Sci 36 (2002), 301-313.
55. A. Del Pia and C. Filipi, A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, Int Trans Oper Res 13 (2006), 125-141.
56. M. Dror (Editor), Arc Routing: Theory, solutions and applications, Kluwer Academic Publishers, Boston, 2000.
57. M. Dror and M. Haouari, Generalized steiner problems and other variants, J Combinat Optim 4 (2000), 415-436.
58. M. Dror and A. Langevin, A generalized traveling salesman problem approach to the directed clustered rural postman problem, Transport Sci 31 (1997), 187-192.
59. M. Dror and J.M.Y. Leung, "Combinatorial optimization in a cattle yard: Feed distribution, vehicle scheduling, lot sizing and dynamic pen assignment," Industrial applications of combinatorial optimization, G. Yu (Editor), Kluwer, 1998, pp. 142-171.
60. M. Dror, H. Stern, and P. Trudeau, Postman tour on a graph with precedence relations on arcs, Networks 17 (1987), 283-294.
61. J. Edmonds and E.L. Johnson, Matching, euler tours and the Chinese postman problem, Math Program 5 (1973), 88-124.
62. R. Eglese and A. Letchford, "Polyhedral theory for arc routing problems," Arc Routing: Theory, solutions and applications, M. Dror (Editor), Kluwer Academic Publishers, New York, 2000.
63. H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems, Part 1: The Chinese postman problem, Oper Res 43 (1995), 231-242.
64. H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems, Part 2: The rural postman problem, Oper Res 43 (1995), 399-414.
65. D. Feillet, P. Dejax, and Gendreau, The profitable arc tour problem: Solution with a branch and price algorithm, Transportation Sci 39 (2005), 539-552.
66. E. Fernández, O. Meza, R. Garfinkel, and M. Ortega, On the undirected rural postman problem: Tight bounds based on a new formulation, Oper Res 51 (2003), 281-291.
67. P. Fernández de Córdoba, L.M. Garcia-Raffi, and J.M. Sanchis, A heuristic algorithm based on Monte Carlo methods for the rural postman problem, Comput Oper Res 25 (1998), 1097-1106.
68. B. Fleischmann, A cutting plane procedure for the traveling salesman problem on road networks, Eur J Oper Res 21 (1985), 307-317.
69. G. Fleury, P. Lacomme, and C. Prins, "Evolutionary algorithms for stochastic arc routing problems," Applications of evolutionary computing, G.R. Raidl, S. Cagnoni, J. Branke, D.W. Corne, R. Drechsler,Y. Jin, C.G. Johnson, P. Machado, E. Marchiori, F. Rothlauf, G.D. Smith, and G. Squillero (Editors), Lectures Notes in Computer Science 3005, Springer, 2004, pp. 501-512.
70. G. Fleury, P. Lacomme, C. Prins, and W. Ramdane-Chérif, Improving sensitivity of solutions to arc routing problems, J Oper Res Soci 56 (2005), 526-538. (Pubitemid 40567539)
71. L.R. Ford and D.R. Fulkerson, Flows in networks, Princeton University Press, 1962.
72. G.N. Frederickson, Approximation algorithms for some postman problems, J ACM 26 (1979), 538-554.
73. R. Fukasawa, J. Lysgaard, M. Poggi De Aragão, M. Reis, E. Uchoa, and R.F.Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Math Program 106 (2006), 491-511.
74. R. Garfinkel and J. Webb, On crossings, the crossing postman problem, and the rural postman problem, Networks 34 (1999), 173-180.
75. G. Ghiani, F. Guerriero, G. Laporte, and R. Musmanno,Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions, J Math Model Appl 3 (2004), 209-223.
76. G. Ghiani, F. Guerriero, G. Improta, and R. Musmanno, Waste collection in Southern Italy: Solution of a real-life arc routing problem, Int Trans Oper Res 12 (2005), 135-144.
77. G. Ghiani and G. Improta, An algorithm for the hierarchical Chinese postman problem, Oper Res Lett 26 (2000), 27-32.
78. G. Ghiani and G. Improta, The laser-plotter beam routing problem, J Oper Res Soci 52 (2001), 887-903.
79. G. Ghiani, G. Improta, and G. Laporte, The capacitated arc routing problem with intermediate facilities, Networks 37 (2001), 134-143.
80. G. Ghiani, D. Laganà, and R. Musmanno, A constructive heuristic for the undirected rural postman Problem, Comput Oper Res 33 (2006), 3450-3457.
81. G. Ghiani and G. Laporte, A branch-and-cut algorithm for the undirected rural postman problem, Math Program 87 (2000), 467-481.
82. G. Ghiani and G. Laporte, Location-arc routing problems, OPSEARCH 38 (2001), 151-159.
83. G. Ghiani, R. Musmanno, G. Paletta, and C. Triki, A heuristic for the periodic rural postman problem, Comput Oper Res 32 (2005), 219-228.
84. B.L. Golden, J.S. DeArmon, and E.K. Baker, Computational experiments with algorithms for a class of routing problems, Comput Oper Res 10 (1983), 47-59.
85. B.L. Golden and R.T. Wong, Capacitated arc routing problems, Networks 11 (1981), 305-315.
86. D. Gómez-Cabrero, J.M. Belenguer, and E. Benavent, Cutting plane and column generation for the capacitated arc routing problem, Paper presented at ORP3, Valencia, 2005.
87. P. Greistorfer,Atabu scatter search metaheuristic for the arc routing problem, Comput Indus Eng 44 (2003), 249-266.
88. I. Gribkovskaia, O. Halskau, and G. Laporte, The Bridges of Königsberg -AHistorical Perspective, Networks 49 (2007), 199-203.
89. M. Grötschel and Z. Win, A cutting plane algorithm for the windy postman problem, Math Program 55 (1992), 339-358.
90. G.W. Groves, J. Le Roux, and J.H.VanVuuren, On a routing and scheduling problem concerning multiple edge traversals in graphs, Networks 46 (2005), 69-81.
91. G.W. Groves and J.H. Van Vuuren, Efficient heuristics for the rural postman problem, ORION 21 (2005), 33-51.
92. C. Guéguen, Exact solution methods for vehicle routing problems, PhD thesis, Central School of Paris (in French), 1999.
93. A. Hertz, "Recent trends in arc routing," Graph Theory, Combinatorics and Algorithmics: Interdisciplinary Applications, I. Hartman and M. Golumbic (Editors), Kluwer, 2005, pp. 215-236.
94. A. Hertz, G. Laporte, and P. Nanchen-Hugo, Improvement procedures for the undirected rural postman problem, INFORMS J Comput 11 (1999), 53-62.
95. A. Hertz, G. Laporte, and M. Mittaz, A tabu search heuristic for the capacitated arc routing problem, Oper Res 48 (2000), 129-135.
96. A. Hertz and M. Mittaz, "Heuristic algorithms," Arc Routing: Theory, solutions and applications, M. Dror (Editor), Kluwer Academic Publishers, New York, 2000.
97. A. Hertz and M. Mittaz, A variable neighborhood descent algorithm for the undirected capacitated arc routing problem, Transport Sci 35 (2001), 425-434.
98. S. Irnich, A note on postman problems with zigzag service, INFOR 43 (2005), 33-39.
99. S. Irnich, Solution of real-world postman problems, Eur J Oper Res 190 (2008), 52-67.
100. S. Irnich, Undirected postman problems with zigzagging option: A cutting-plane approach, Comput Oper Res 35 (2008), 3998-4009.
101. P. Korteweg and T. Volgenant, On the hierarchical Chinese postman problem with linear ordered classes, Eur J Oper Res 169 (2006), 41-52.
102. N. Labadi, C. Prins, and M. Reghioui, "An evolutionary algorithm with distance measure for the split delivery arc routing problem," Recent advances in evolutionary computation for combinatorial optimization, C. Cotta and J. van Hemert (Editors), Studies in Computational Intelligence 153, Springer, 2008, pp. 275-294.
103. N. Labadi, C. Prins, and M. Reghioui, "GRASP with path relinking for the capacitated arc routing problem with time windows," Advances in computational intelligence in transport, logistics and supply chain management, A. Fink and F. Rothlauf (Editors), Studies in Computational Intelligence 144, Springer, 2009, pp. 111-135.
104. P. Lacomme, C. Prins, andW. Ramdane-Cherif, "A genetic algorithm for the capacitated arc routing problem and its extensions," Applications of evolutionary computing, E.J.W. Boers, P.L. Lanzi, and J. Gottlieb (Editors), Lecture Notes in Computer Science 2037, Springer, 2001, pp. 473-483.
105. P. Lacomme, C. Prins, and W. Ramdane-Chérif, Competitive memetic algorithms for arc routing problems, Annals Oper Res 131 (2004), 159-185. (Pubitemid 39187378)
106. P. Lacomme, C. Prins, andW. Ramdane-Chérif, Evolutionary algorithms for periodic arc routing problems, Eur J Oper Res 165 (2005), 535-553. (Pubitemid 40206381)
107. P. Lacomme, C. Prins, and M. Sevaux, A genetic algorithm for a bi-objective capacitated arc routing problem, Comput Oper Res 33 (2006), 3473-3493.
108. G. Laporte, Modeling and solving several classes of arc routing problems as traveling salesman problems, Comput Oper Res 24 (1997), 1057-1061.
109. A.N. Letchford and R.W. Eglese, The rural postman problem with deadline classes, Eur J Oper Res 105 (1998), 390-400.
110. A.N. Letchford, G. Reinelt, and D.O. Theis, "A faster exact separation algorithm for blossom inequalities," Integer programming and combinatorial Optimization, D. Bienstock and G. Nemhausser (Editors), Lecture Notes in Computer Science 3064, Springer-Verlag, 2004, pp. 196-205.
111. H. Longo, M. Poggi de Aragão, and E. Uchoa, Solving capacitated arc routing problems using a transformation to the CVRP, Comput Oper Res 33 (2006), 1823-1837.
112. C. Malandraki and M.S. Daskin, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, Eur J Oper Res 65 (1993), 218-234.
113. V. Maniezzo and M. Roffilli, "Algorithms for large directed capacitated arc routing instances: Urban solid waste collection operational support," Recent advances in evolutionary computation for combinatorial optimization, C. Cotta and J. van Hemert (Editors), Studies in Computational Intelligence 153, Springer, 2008, pp. 259-274.
114. F. Marzolf, M. Trépanier, and A. Langevin, Road network monitoring: Algorithms and a case study, Comput Oper Res 33 (2006), 3494-3507.
115. L.M. Moreira, J.F. Oliveira, A.M. Gomes, and J.S. Ferreira, Heuristics for a dynamic rural postman problem, Comput Oper Res 34 (2007), 3281-3294.
116. M.C. Mourão and T. Almeida, Lower-bounding and heuristic methods for a refuse collection vehicle routing problem, Eur J Oper Res 121 (2000), 420-434.
117. M.C. Mourão and L. Amado, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, Eur J Oper Res 160 (2005), 139-153.
118. M.C. Mourão, A.C. Nunes, and C. Prins, Heuristic methods for the sectoring-arc routing problem, Eur J Oper Res 196 (2009), 856-868.
119. P.A. Mullaseril, Capacitated rural postman problem with time windows and split delivery, PhD thesis, MIS Department, University of Arizona, 1996.
120. L. Muyldermans, Routing, districting and location for arc traversal problems, PhD thesis, Catholic University of Leuven, Belgium, 2003.
121. L. Muyldermans, P. Beullens, D. Cattrysse, and D. Van Oudheusden, Exploring variants of 2-Opt and 3-Opt for the general routing problem, Oper Res 53 (2005), 982-995.
122. L. Muyldermans, D. Cattrysse, and D. Van Oudheusden, District design for arc-routing applications, J Oper Res Soci 54 (2003), 1209-1221.
123. L. Muyldermans, D. Cattrysse, D. Van Oudheusden, and T. Lotan, Districting for salt spreading operations, Eur J Oper Res 139 (2002), 521-532.
124. D. Naddef and G. Rinaldi, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, Math Program 51 (1991), 359-400.
125. M.J. Negreiros, W. Rodrigues, A.W. de Castro, E. Ferreira, G. Alves, F.J. Negreiros, G. Cutini, B. Fernandes, and L.W. Lessa,OProblema do Carteiro Chinês, Algoritmos Exatos e um Ambiente MVI para Análise de suas Instâncias: Sistema XNÊS, Pesquisa Operacional 29 (2009), 323-363.
126. C.S. Orloff, A fundamental problem in vehicle routing, Networks 4 (1974), 35-64.
127. A. Oukil, Exploiting sparsity in vehicle routing algorithm, PhD Thesis, University of Lancaster, 2008.
128. W.L. Pearn, A. Assad, and B.L. Golden, Transforming arc routing into node routing problems, Comput Oper Res 14 (1987), 285-288.
129. W.L. Pearn and W.C. Chiu, Approximate solutions for the maximum benefit Chinese postman problem, Int J Syst Sci 36 (2005), 815-822.
130. W.L. Pearn and J.B. Chou, Improved solutions for the chinese postman problem on mixed networks, Comput Oper Res 26 (1999), 819-827.
131. W.L. Pearn and K.H. Wang, On the maximum benefit chinese postman problem, Omega 31 (2003), 269-273.
132. I. Plana, The windy general routing problem, PhD Thesis, University of Valencia (in Spanish), 2005.
133. C. Prins and S. Bouchenoua, "A memetic algorithm solving the VRP, the CARP, and more general routing problems with nodes, edges and arcs," Recent advances in memetic algorithms, W. Hart, N. Krasnogor, and J. Smith (Editors), Studies in Fuzziness and Soft Computing 166, Springer, 2004, pp. 65-85.
134. C. Prins, N. Labadi, and M. Reghioui, Tour splitting heuristics for vehicle routing problems, Int J Product Res 47 (2009), 507-536.
135. B. Raghavachari and J. Veerasamy, A 3/2 approximation algorithm for the mixed postman problem, SIAM J Discrete Math 12 (1999), 425-433.
136. B. Raghavachari and J. Veerasamy, A 3/2-approximation algorithm for the windy postman problem, Technical Report, University of Texas, Dallas, 2001.
137. G. Reinelt and D.O. Theis, Transformation of facets of the general routing problem polytope,SIAMJ Optim 16 (2005), 220-234.
138. G. Reinelt and D.O. Theis, On the general routing polytope, Discr Appl Math 156 (2008), 368-384.
139. J. Sniezek, L. Bodin, L. Levy, and M. Ball, "The capacitated arc routing problem with vehicle/site dependencies: The Philadephia experience," The vehicle routing problem, P. Toth and D. Vigo (Editors), SIAM, 2001, pp. 287-308.
140. M. Tagmouti, M. Gendreau, and J.-Y. Potvin, Arc routing problems with time-dependent service costs, Eur J Oper Res 181 (2007), 30-39.
141. D.O. Theis, Das General Routing Problem mit binären variablen, Master's Thesis, University of Heidelberg, 2001.
142. G. Ulusoy, The fleet size and mix problem for capacitated arc routing, Eur J Oper Res 22 (1985), 329-337.
143. Z. Win, Contributions to routing problems, PhD Thesis, University of Augsburg, 1987.
144. Z.Win, On the windy postman problem on eulerian graphs, Math Program 44 (1989), 97-112.
145. S. Wøhlk, Contributions to arc routing, PhD Thesis, Faculty of Social Sciences, University of Southern Denmark, 2005.
146. S. Wøhlk, New lower bound for the capacitated arc routing problem, Comput Oper Res 33 (2006), 3458-3472.
147. S. Wøhlk, An approximation algorithm for the capacitated arc routing problem, Open Oper Res J 2 (2008), 8-12.
148. H. Yan and G. Thompson, Finding postal carrier walk paths in mixed graphs, Comput Optim Appl 9 (1998), 229-247.
149. K. Yaoyuenyong, P. Charnsethikul, and V. Chankong, A heuristic algorithm for the mixed chinese postman problem, Optim Eng 3 (2002), 157-187.
150. F. Zaragoza, The windy postman problem on series-parallel graphs, Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, Nancy, France, 2005, pp. 161-166.