E. Amaldi, G. Galbiati, and F. Maffioli, On minimum reload cost paths, tours, and flows, Networks, vol.113, issue.3, pp.254-260, 2011.
DOI : 10.1002/net.20423

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

A. Billionnet, S. Elloumi, and M. C. Plateau, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Discrete Applied Mathematics, vol.157, issue.6, pp.1185-1197, 2009.
DOI : 10.1016/j.dam.2007.12.007
URL : https://hal.archives-ouvertes.fr/hal-01125253

C. Buchheim and E. Traversi, Quadratic 0?1 optimization using separable underestimators, Tech. rep., Optimization Online, 2015.

A. Caprara, Constrained 0???1 quadratic programming: Basic approaches and extensions, European Journal of Operational Research, vol.187, issue.3, pp.1494-1503, 2008.
DOI : 10.1016/j.ejor.2006.09.028

P. Carraresi and F. Malucelli, A New Lower Bound for the Quadratic Assignment Problem, Operations Research, vol.40, issue.1-supplement-1, pp.22-27, 1992.
DOI : 10.1287/opre.40.1.S22

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

P. C. Gilmore, Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.2, pp.305-313, 1962.
DOI : 10.1137/0110022

E. L. Lawler, The Quadratic Assignment Problem, Management Science, vol.9, issue.4, pp.586-599, 1963.
DOI : 10.1287/mnsc.9.4.586

K. Murakami and H. S. Kim, Comparative study on restoration schemes of survivable ATM networks, Proceedings of INFOCOM '97, pp.345-352, 1997.
DOI : 10.1109/INFCOM.1997.635156

S. Sahni and T. Gonzalez, P-Complete Approximation Problems, Journal of the ACM, vol.23, issue.3, pp.555-565, 1976.
DOI : 10.1145/321958.321975

S. Sen, R. Pillai, S. Joshi, and A. K. Rathi, A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems, Transportation Science, vol.35, issue.1, pp.37-49, 2001.
DOI : 10.1287/trsc.35.1.37.10141

R. A. Sivakumar and R. Batta, The Variance-Constrained Shortest Path Problem, Transportation Science, vol.28, issue.4, pp.309-316, 1994.
DOI : 10.1287/trsc.28.4.309