1. Optimod’Lyon website, (21 July 2014). http://www.optimodlyon.com/
2. Abeledo, H., Fukasawa, R., Pessoa, A., Uchoa, E.: The time dependent traveling salesman problem: polyhedra and algorithm. Mathematical Programming Computation 5(1), 27–55 (2013)
3. Aguiar Melgarejo, P., Baudel, T., Solnon, C.: Global and reactive routing in urban context: first experiments and difficulty assessment. In: CP-2012 Workshop on Optimization and Smart Cities, October 2012
4. Baptiste, P., Laborie, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling and planning. In: F. Rossi, P. van Beek, T.W. (eds.) Handbook of Constraint Programming, chap. 22, pp. 759–798. Elsevier (2006)
5. Baptiste, P., Le Pape, C.: Disjunctive constraints for manufacturing scheduling: principles and extensions. In: Proc. 3rd International Conference on Computer Integrated Manufacturing (1995)