S. Anily, M. Gendreau, and G. Laporte, The preemptive swapping problem on a tree, Networks, vol.39, 2005.
DOI : 10.1002/net.20451

S. Anily and R. Hassin, The swapping problem, Networks, vol.117, issue.4, pp.419-433, 1992.
DOI : 10.1002/net.3230220408

N. Ascheuer, L. Escudero, M. Grötschel, and M. Stoer, A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing), SIAM Journal on Optimization, vol.3, issue.1, pp.25-42, 1993.
DOI : 10.1137/0803002

N. Ascheuer, M. Jünger, and G. Reinelt, A Branch & Cut algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints, Computational Optimization and Applications, vol.17, issue.1, pp.61-84, 2000.
DOI : 10.1023/A:1008779125567

M. J. Atallah and S. R. Kosaraju, Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel, SIAM Journal on Computing, vol.17, issue.5, p.849, 1988.
DOI : 10.1137/0217053

E. Balas, M. Fischetti, and W. Pulleyblank, The precedence constrained asymmetric traveling salesman problem, Mathematical Programming, vol.68, pp.241-265, 1995.

G. Berbeglia, J. F. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a??classification scheme and survey, TOP, vol.41, issue.2, pp.1-31, 2007.
DOI : 10.1007/s11750-007-0009-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.7359

C. Bordenave, M. Gendreau, and G. Laporte, A branch-and-cut algorithm for the preemptive swapping problem, Networks, vol.92, issue.4, 2008.
DOI : 10.1002/net.20447

C. Bordenave, M. Gendreau, and G. Laporte, Heuristics for the mixed swapping problem, Computers & Operations Research, vol.37, issue.1, 2008.
DOI : 10.1016/j.cor.2009.03.032

S. Chen and S. Smith, Commonality and genetic algorithms, 1996.

J. F. Cordeau, M. Iori, G. Laporte, and J. J. Salazar-gonzález, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, Networks, vol.37, issue.1, 2006.
DOI : 10.1002/net.20312

J. F. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.174, issue.1, pp.29-46, 2007.
DOI : 10.1007/s10479-007-0170-8

C. E. Cortés, C. Matamala, and . Contardo, The Pickup and Delivery Problem with Transfers: Formulation and Solution Approaches, VII French ? Latin American Congress on Applied Mathematics, 2005.

I. Dumitrescu, Polyhedral results for the pickup and delivery travelling salesman problem, Tech. Rep, 2005.

M. T. Fiala-timlin, Precedence constrained routing and helicopter scheduling, 1989.

M. T. Fiala-timlin and W. R. Pulleyblank, Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design, Interfaces, vol.22, issue.3, pp.100-111, 1992.
DOI : 10.1287/inte.22.3.100

G. N. Frederickson and D. Guan, Preemptive Ensemble Motion Planning on a Tree, SIAM Journal on Computing, vol.21, issue.6, p.1130, 1992.
DOI : 10.1137/0221066

G. N. Frederickson and D. J. Guan, Nonpreemptive Ensemble Motion Planning on a Tree, Journal of Algorithms, vol.15, issue.1, pp.29-60, 1993.
DOI : 10.1006/jagm.1993.1029

G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation Algorithms for Some Routing Problems, SIAM Journal on Computing, vol.7, issue.2, p.178, 1978.
DOI : 10.1137/0207017

L. M. Gambardella and M. Dorigo, An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem, INFORMS Journal on Computing, vol.12, issue.3, pp.237-255, 2000.
DOI : 10.1287/ijoc.12.3.237.12636

L. Gouveia and P. Pesneau, On extended formulations for the precedence constrained asymmetric traveling salesman problem, Networks, vol.22, issue.2, pp.77-89, 2006.
DOI : 10.1002/net.20122
URL : https://hal.archives-ouvertes.fr/inria-00281586

P. Healy and R. Moll, A new extension of local search applied to the Dial-A-Ride Problem, European Journal of Operational Research, vol.83, issue.1, pp.83-104, 1995.
DOI : 10.1016/0377-2217(93)E0292-6

H. Hernández-pérez and J. Salazar-gonzález, The multicommodity one-to-one pickup-anddelivery traveling salesman problem, 2008.

B. Kalantari, A. V. Hill, and S. R. Arora, An algorithm for the traveling salesman problem with pickup and delivery customers, European Journal of Operational Research, vol.22, issue.3, pp.377-386, 1985.
DOI : 10.1016/0377-2217(85)90257-7

H. L. Kerivin, M. Lacroix, and A. R. Mahjoub, Models for the single-vehicle preemptive pickup and delivery problem, Journal of Combinatorial Optimization, vol.61, issue.1, 2007.
DOI : 10.1007/s10878-010-9349-z
URL : https://hal.archives-ouvertes.fr/hal-01497105

H. L. Kerivin, M. Lacroix, and A. R. Mahjoub, The Eulerian closed walk with precedence path constraints problem, 03 (also submitted for publication in SIAM Journal of Computing), 2007.
URL : https://hal.archives-ouvertes.fr/hal-01497107

S. Lin, Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.
DOI : 10.1002/j.1538-7305.1965.tb04146.x

S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Operations Research, vol.21, issue.2, pp.498-516, 1973.
DOI : 10.1287/opre.21.2.498

J. Little, K. Murty, D. Sweeney, and C. Karel, An Algorithm for the Traveling Salesman Problem, Operations Research, vol.11, issue.6, pp.972-989, 1963.
DOI : 10.1287/opre.11.6.972

S. Mitrovic-minic, Pickup and delivery problem with time windows: A survey, 1998.

S. Mitrovic-minic and G. Laporte, The pickup and delivery problem with time windows and transshipment. INFOR, pp.217-227, 2006.

R. Montemanni, D. H. Smith, and L. M. Gambardella, A heuristic manipulation technique for the sequential ordering problem, Computers & Operations Research, vol.35, issue.12, pp.3931-3944, 2008.
DOI : 10.1016/j.cor.2007.05.003

P. Oertel, Routing with Reloads. Doktorarbeit, 2000.

S. N. Parragh, K. F. Doerner, and R. F. Hartl, A survey on pickup and delivery problems, Journal f??r Betriebswirtschaft, vol.1667, issue.2, pp.21-51, 2008.
DOI : 10.1007/s11301-008-0036-4

H. N. Psaraftis, A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem, Transportation Science, vol.14, issue.2, pp.130-154, 1980.
DOI : 10.1287/trsc.14.2.130

J. Renaud, F. Boctor, and G. Laporte, Perturbation heuristics for the pickup and delivery traveling salesman problem, Computers & Operations Research, vol.29, issue.9, pp.1129-1141, 2002.
DOI : 10.1016/S0305-0548(00)00109-X

J. Renaud, F. Boctor, and J. Ouenniche, A heuristic for the pickup and delivery traveling salesman problem, Computers & Operations Research, vol.27, issue.9, pp.905-916, 2000.
DOI : 10.1016/S0305-0548(99)00066-0

K. M. Ruland and E. Y. Rodin, The pickup and delivery problem: Faces and branch-and-cut algorithm, Computers & Mathematics with Applications, vol.33, issue.12, pp.1-13, 1997.
DOI : 10.1016/S0898-1221(97)00090-4
URL : http://doi.org/10.1016/s0898-1221(97)00090-4

M. W. Savelsberg and M. Sol, The General Pickup and Delivery Problem, Transportation Science, vol.29, issue.1, pp.17-29, 1995.
DOI : 10.1287/trsc.29.1.17