H. M. Afsar, A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows, Electronic Notes in Discrete Mathematics, vol.36, pp.319-326, 2010.
DOI : 10.1016/j.endm.2010.05.041

A. Amaya, A. Langevin, and M. Trépanier, The capacitated arc routing problem with refill points, Operations Research Letters, vol.35, issue.1, pp.45-53, 2007.
DOI : 10.1016/j.orl.2005.12.009

A. Amberg, W. Domschke, and S. Voß, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, European Journal of Operational Research, vol.124, issue.2, pp.360-376, 2000.
DOI : 10.1016/S0377-2217(99)00170-8

U. Aminu and R. Eglese, A constraint programming approach to the Chinese postman problem with time windows, Computers & Operations Research, vol.33, issue.12, pp.3423-3431, 2006.
DOI : 10.1016/j.cor.2005.02.012

S. Amponsah and S. Salhi, The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries, Waste Management, vol.24, issue.7, pp.711-721, 2004.
DOI : 10.1016/j.wasman.2004.01.008

J. Aráoz, E. Fernández, and C. Zoltan, Privatized rural postman problems, Computers & Operations Research, vol.33, issue.12, pp.3432-3449, 2006.
DOI : 10.1016/j.cor.2005.02.013

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316

J. Bautista, E. Fernández, and J. Pereira, Solving an urban waste collection problem using ants heuristics, Computers & Operations Research, vol.35, issue.9, pp.3020-3033, 2007.
DOI : 10.1016/j.cor.2007.01.029
URL : http://hdl.handle.net/2117/1098

J. Belenguer, E. Benavent, P. Lacomme, and C. Prins, Lower and upper bounds for the mixed capacitated arc routing problem, Computers & Operations Research, vol.33, issue.12, pp.3363-3383, 2006.
DOI : 10.1016/j.cor.2005.02.009
URL : https://hal.archives-ouvertes.fr/hal-00119777

E. Benavent, A. Carrotta, A. Corberán, J. M. Sanchis, and D. Vigo, Lower bounds and heuristics for the Windy Rural Postman Problem, European Journal of Operational Research, vol.176, issue.2, pp.855-869, 2007.
DOI : 10.1016/j.ejor.2005.09.021

E. Benavent, A. Corberán, E. Piñana, I. Planaa, and J. M. Sanchisb, New heuristic algorithms for the windy rural postman problem, Computers & Operations Research, vol.32, issue.12, pp.3111-3128, 2005.
DOI : 10.1016/j.cor.2004.04.007

J. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

P. Beullens, L. Muyldermans, D. Cattrysse, and D. V. Oudheusden, A guided local search heuristic for the capacitated arc routing problem, European Journal of Operational Research, vol.147, issue.3, pp.629-643, 2003.
DOI : 10.1016/S0377-2217(02)00334-X

J. Blitz, Electrical and Magnetic Methods of Non-destructive Testing, 1997.
DOI : 10.1007/978-94-011-5818-3

D. Bommisetty and M. Dessouky, Scheduling collection of recyclable material at Northern Illinois University campus using a two-phase algorithm, Computers & Industrial Engineering, vol.35, issue.3-4, pp.435-438, 1998.
DOI : 10.1016/S0360-8352(98)00127-2

J. Brandão and R. Eglese, A deterministic tabu search algorithm for the capacitated arc routing problem, Computers & Operations Research, vol.35, issue.4, pp.1112-1126, 2008.
DOI : 10.1016/j.cor.2006.07.007

P. Brucker, Graph Theoretic Concepts in Computer Science, Chapitre The Chinese Postman Problem for Mixed Graphs, pp.354-366, 1981.

G. Budai, D. Huisman, and R. Dekker, Scheduling preventive railway maintenance activities, Journal of the Operational Research Society, vol.99, issue.9, pp.1035-1044, 2006.
DOI : 10.1016/S0377-2217(97)00319-6
URL : https://repub.eur.nl/pub/1632/ei200441.pdf

E. A. Cabral, M. Gendreau, G. Ghiani, and G. Laporte, Solving the hierarchical Chinese postman problem as a rural postman problem, European Journal of Operational Research, vol.155, issue.1, pp.44-50, 2004.
DOI : 10.1016/S0377-2217(02)00813-5

G. Carpaneto, M. Dell-'amico, and P. Toth, Exact solution of large-scale, asymmetric traveling salesman problems, ACM Transactions on Mathematical Software, vol.21, issue.4, pp.394-409, 1995.
DOI : 10.1145/212066.212081

. Cheung, Railway Track Possession Assignment Using Constraint Satisfaction. Engineering Applications of AI, 1999.

N. Christofides, The optimum traversal of a graph, Omega, vol.1, issue.6, pp.719-732, 1973.
DOI : 10.1016/0305-0483(73)90089-3

F. Chu, N. Labadi, and C. Prins, Heuristics for the periodic capacitated arc routing problem, Journal of Intelligent Manufacturing, vol.12, issue.5, pp.243-251, 1007.
DOI : 10.1007/s10845-004-5892-8

G. Clarke and J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, vol.12, issue.4, pp.568-581, 1964.
DOI : 10.1287/opre.12.4.568

G. Codato and M. Fischetti, Combinatorial Benders??? Cuts, Integer Programming and Combinatorial Optimization, pp.29-46, 2004.
DOI : 10.1007/978-3-540-25960-2_14

A. Corberán, R. Martí, and A. Romero, Heuristics for the Mixed Rural Postman Problem, Computers & Operations Research, vol.27, issue.2, pp.183-203, 2000.
DOI : 10.1016/S0305-0548(99)00031-3

A. Corberán, R. Martí, and J. Sanchis, A GRASP heuristic for the mixed Chinese postman problem, European Journal of Operational Research, vol.142, issue.1, pp.70-80, 2002.
DOI : 10.1016/S0377-2217(01)00296-X

A. Corberán, R. Martmí, E. Martmínez, and D. Soler, The Rural Postman Problem on mixed graphs with turn penalties, Computers & Operations Research, vol.29, issue.7, pp.887-903, 2002.
DOI : 10.1016/S0305-0548(00)00091-5

G. B. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960.
DOI : 10.1287/opre.8.1.101

D. Den-hertog, J. Van-zante-de-fokkert, S. Sjamaar, and R. Beusmans, Optimal working zone division for safe track maintenance in The Netherlands, Accident Analysis & Prevention, vol.37, issue.5, pp.890-893, 2005.
DOI : 10.1016/j.aap.2005.04.006

M. Dror, Arc Routing : Theory, Solutions and Applications, 2000.
DOI : 10.1007/978-1-4615-4495-1

M. Dror, H. Stern, and P. Trudeau, Postman Tour on a Graph With Precedence Relation on Arcs. Networks, pp.283-294, 1987.

J. Edmonds and E. L. Johnson, Matching, Euler tours and the Chinese postman, Mathematical Programming, pp.88-124, 1973.
DOI : 10.1007/BF01580113

H. A. Eiselt, M. Gendreau, and G. Laporte, Arc Routing Problems, Part I: The Chinese Postman Problem, Operations Research, vol.43, issue.2, pp.231-242, 1995.
DOI : 10.1287/opre.43.2.231

H. A. Eiselt, M. Gendreau, and G. Laporte, Arc Routing Problems, Part II: The Rural Postman Problem, Operations Research, vol.43, issue.3, pp.399-414, 1995.
DOI : 10.1287/opre.43.3.399

L. Euler, Solutio Problematis ad Geometrian Situs Pertinentis Commentarii academiae scientarum Petropolitanae, pp.128-140

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.35, issue.3, pp.216-229, 2004.
DOI : 10.1002/net.20033

M. Fischetti, D. Salvagnin, and A. Zanette, A note on the selection of Benders??? cuts, Mathematical Programming, pp.175-182
DOI : 10.1007/s10107-010-0365-7

J. Fokkert, D. Den-hertog, F. J. Berg, and J. H. Verhoeven, The Netherlands Schedules Track Maintenance to Improve Track Workers??? Safety, Interfaces, vol.37, issue.2, pp.133-142, 2007.
DOI : 10.1287/inte.1060.0246

G. N. Frederickson, Approximation Algorithms for Some Postman Problems, Journal of the ACM, vol.26, issue.3, pp.538-554, 1979.
DOI : 10.1145/322139.322150

L. Fu, M. Trudel, and V. Kim, Optimizing winter road maintenance operations under real-time information, European Journal of Operational Research, vol.196, issue.1, pp.332-341, 2009.
DOI : 10.1016/j.ejor.2008.03.001

M. R. Garey and D. S. Johnson, Computers and Intractability ; A Guide to the Theory of NP-Completeness, 1990.

G. Ghiani and G. Improta, An algorithm for the hierarchical Chinese postman problem, Operations Research Letters, vol.26, issue.1, pp.27-32, 2000.
DOI : 10.1016/S0167-6377(99)00046-2

G. Ghiani and G. Improta, An efficient transformation of the generalized vehicle routing problem, European Journal of Operational Research, vol.122, issue.1, pp.11-17, 2000.
DOI : 10.1016/S0377-2217(99)00073-9

G. Ghiani, G. Improta, and G. Laporte, The capacitated arc routing problem with intermediate facilities, Networks, vol.12, issue.3, pp.134-143, 2001.
DOI : 10.1002/net.3

B. Golden, E. Baker, and J. Dearmon, Computational experiments with algorithms for a class of routing problems, Computers & Operations Research, vol.10, issue.1, pp.47-59, 1983.
DOI : 10.1016/0305-0548(83)90026-6

C. Grimes, Application of genetic techniques to the planning of railway track maintenance work, 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), pp.467-472, 1995.
DOI : 10.1049/cp:19951093

M. Guan, A Survey of the Chinese Postman Problem, J. Math. Res. and Expos, vol.4, pp.113-119, 1984.

E. Hebrard, Robust Solutions for Constraint Satisfaction and Optimisation under Uncertainty, Thèse de doctorat, 2006.

A. Higgins, Scheduling of railway track maintenance activities and crews, Journal of the Operational Research Society, vol.49, issue.10, pp.1026-1033, 1998.
DOI : 10.1057/palgrave.jors.2600612

K. Holmberg, On the convergence of cross decomposition, Mathematical Programming, vol.34, issue.1, pp.269-296, 1990.
DOI : 10.1007/BF01580863

J. Hooker and G. Ottosson, Logic-based Benders decomposition, Mathematical Programming, pp.33-60, 2003.
DOI : 10.1007/s10107-003-0375-9
URL : http://ba.gsia.cmu.edu/jnh/benders.ps

. Infralog, Catalogue des engins + fiches techniques. Rapport technique, SNCF, 2010.

S. Irnich, Solution of real-world postman problems, European Journal of Operational Research, vol.190, issue.1, 2007.
DOI : 10.1016/j.ejor.2007.06.002

E. L. Johnson and S. Wohlk, Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation. Rapport technique, Centre for Operations Research Applications in Logistics, 2008.

M. Kao and E. , Encyclopedia of Algorithms, 2008.

B. Kim, S. Kim, and S. Sahoo, Waste collection vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.12, pp.3624-3642, 2006.
DOI : 10.1016/j.cor.2005.02.045

P. Korteweg and T. Volgenant, On the Hierarchical Chinese Postman Problem with linear ordered classes, European Journal of Operational Research, vol.169, issue.1, pp.41-52, 2006.
DOI : 10.1016/j.ejor.2004.06.003

P. Lacomme, C. Prins, and W. Ramdane-cherif, Competitive Memetic Algorithms for Arc Routing Problems, Annals of Operations Research, vol.131, issue.1-4, pp.159-185, 2004.
DOI : 10.1023/B:ANOR.0000039517.35989.6d
URL : https://hal.archives-ouvertes.fr/hal-00119814

P. Lacomme, C. Prins, and W. Ramdane-chérif, Evolutionary algorithms for periodic arc routing problems, European Journal of Operational Research, vol.165, issue.2, pp.535-553, 2005.
DOI : 10.1016/j.ejor.2004.04.021
URL : https://hal.archives-ouvertes.fr/inria-00104119

G. Laporte and F. Semet, The Vehicle Routing Problem, Chapitre Classical Heuristics for the Capacitated VRP, pp.109-128, 2001.

H. Longo, M. P. De-aragão, and E. Uchoa, Solving capacitated arc routing problems using a transformation to the CVRP, Computers & Operations Research, vol.33, issue.6, pp.1823-1837, 2006.
DOI : 10.1016/j.cor.2004.11.020

M. Lübbecke and J. Desrosiers, Selected Topics in Column Generation, Operations Research, vol.53, issue.6, pp.1007-1023, 2005.
DOI : 10.1287/opre.1050.0234

F. Marzolf, M. Trépanier, and A. Langevin, Road network monitoring: algorithms and a case study, Computers & Operations Research, vol.33, issue.12, pp.3494-3507, 2006.
DOI : 10.1016/j.cor.2005.02.040

K. Mei-ko, Graphic Programming Using Odd or Even Points, Chinese Mathematical Journal, vol.1, pp.273-277, 1962.

E. Minieka, The Chinese Postman Problem for Mixed Networks, Management Science, vol.25, issue.7, pp.643-648, 1979.
DOI : 10.1287/mnsc.25.7.643

P. Mullaseri, Capacitated Rural Postman Problem with Time Windows and Split Delivery, Thèse de doctorat, 1997.

M. Mulvey and R. J. Vanderbei, Robust Optimization of Large-Scale Systems, Operations Research, vol.43, issue.2, pp.264-281, 1995.
DOI : 10.1287/opre.43.2.264

C. Orloff, A Fundamental Problem in Vehicle Routing. Networks, pp.35-64, 1974.

T. Oyama and M. Miwa, Mathematical modeling analyses for obtaining an optimal railway track maintenance schedule, Japan Journal of Industrial and Applied Mathematics, vol.41, issue.3, pp.207-224, 2006.
DOI : 10.1007/BF03167551

C. H. Papadimitriou, On the complexity of edge traversing, Journal of the ACM, vol.23, issue.3, pp.544-554, 1976.
DOI : 10.1145/321958.321974

M. Papaelias, M. Lugg, C. Roberts, and C. Davis, High-speed inspection of rails using ACFM techniques, NDT & E International, vol.42, issue.4, pp.328-335, 2009.
DOI : 10.1016/j.ndteint.2008.12.008

W. Pearn, A. Assad, and B. Golden, Transforming arc routing into node routing problems, Computers & Operations Research, vol.14, issue.4, pp.285-293, 1987.
DOI : 10.1016/0305-0548(87)90065-7

W. L. Pearn, Approximate solutions for the capacitated arc routing problem, Computers & Operations Research, vol.16, issue.6, pp.589-600, 1989.
DOI : 10.1016/0305-0548(89)90044-0

N. Perrier, A. Langevin, and C. Amaya, Vehicle Routing for Urban Snow Plowing Operations, Transportation Science, vol.42, issue.1, pp.44-56, 2008.
DOI : 10.1287/trsc.1070.0195

N. Perrier, A. Langevin, and J. F. Campbell, A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing, Computers & Operations Research, vol.33, issue.1, pp.209-238, 2006.
DOI : 10.1016/j.cor.2004.07.006

N. Perrier, A. Langevin, and J. F. Campbell, A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal, Computers & Operations Research, vol.33, issue.1, pp.239-262, 2006.
DOI : 10.1016/j.cor.2004.07.007

N. Perrier, A. Langevin, and J. F. Campbell, A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading, Computers & Operations Research, vol.34, issue.1, pp.211-257, 2007.
DOI : 10.1016/j.cor.2005.05.007

N. Perrier, A. Langevin, and J. F. Campbell, A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal, Computers & Operations Research, vol.34, issue.1, pp.239-262, 2007.
DOI : 10.1016/j.cor.2005.05.008

W. Ramdane-cherif, Problèmes d'optimisation en tournées sur arcs, Thèse de doctorat, 2002.

W. and R. Cherif, Evolutionary Algorithms for Capacitated Arc Routing problems with Time Windows, 12th IFAC Symposium on Information Control Problems in Manufacturing -INCOM. Saint-Etienne/France, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00104110

R. Rivier and Y. Putallaz, Audit sur l'état du réseau ferré national fran cais, 2005.

S. Spoorendonk, Cut and Column Generation Thèse de doctorat, Faculty of science, 2008.

A. Srinivasan, Improved approximations of packing and covering problems, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.268-276, 1995.
DOI : 10.1145/225058.225138

M. Tagmouti, M. Gendreau, and J. Potvin, Arc routing problems with time-dependent service costs, European Journal of Operational Research, vol.181, issue.1, pp.30-39, 2007.
DOI : 10.1016/j.ejor.2006.06.028

P. Toth and D. Vigo, The Vehicle Routing Problem, Chapitre Branch-and-Bound algorithms for the Capacitated VRP, pp.29-51, 2001.

F. Vanderbeck, On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm, Operations Research, vol.48, issue.1, pp.111-128, 2000.
DOI : 10.1287/opre.48.1.111.12453
URL : https://hal.archives-ouvertes.fr/inria-00342641

S. Wohlk, Contributions to arc routing, Thèse de doctorat, 2005.