Aarts E. & Lenstra J. 1997. Local Search in Combinatorial Optimization. Princeton University Press.

Abramson M., Kim P. & Williams B. 2001. Executing reactive, model-based programs through graph-based temporal planning. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).

Ajili F. & Wallace M. 2004. Hybrid problem solving in ECLiPSe. In Constraint and Integer Programming Toward a Unified Methodology, volume 27 of Operations Research/Computer Science Interfaces Series, Chapter 6. Springer, 2004.

Botea A., Mller M. & Schaeffer J. 2004. Near optimal hierarchical path-finding. Journal of Game Development 1(1), 7–28.

Cerny V. 1985. A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications 45, 41–51.

Dorigo M. & Gambardella L. 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66.

Fox M. & Long D. 2000. Automatic synthesis and use of generic types in planning. In Proceedings of the Artificial Intelligence Planning System, AAAI Press, 196–205.

Fox M. & Long D. 2003. PDDL 2.1: an extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20, 61–124.

Goldberg D. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

Goldman R., Haigh K., Musliner D. & Pelican M. 2002. MACBeth: a multi-agent constraint-based planner. In Proceedings of the 21st Digital Avionics Systems Conference, 2, 7E3:1–8.

Gondran M. & Minoux M. 1995. Graphes et Algorithmes. Editions Eyrolles.

Hansen E. & Zhou R. 2007. Anytime heuristic search. Journal of Artificial Intelligence Research 28, 267–297.

Hart P., Nilsson N. & Raphael B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics 4(2), 100–107.

Hentenryck P. Van, Saraswat V. A. & Deville Y. 1998. Design, implementation, and evaluation of the constraint language CC(FD). The Journal of Logic Programming 37(1–3), 139–164.

Koenig S., Sun X. & Yeoh W. 2009. Dynamic Fringe-Saving A*. In Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2, 891–898.

Laborie P. & Ghallab M. 1995. Planning with Sharable Resource Constraints. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI).

Lucas F. & Guettier C. 2010. Automatic vehicle navigation with bandwidth constraints. In Proceedings of MILCOM 2010, November.

Lucas F. & Guettier C. 2012. Hybrid solving technique for vehicle planning. In Proceedings of Military Communication Conference (MILCOM).

Lucas F., Guettier C., Siarry P., de La Fortelle A. & Milcent A.-M. 2010. Constrained navigation with mandatory waypoints in uncertain environment. International Journal of Information Sciences and Computer Engineering (IJISCE) 1, 75–85.

Meuleau N., Plaunt C., Smith D. & Smith T. 2009. Emergency landing planning for damaged aircraft. In Proceedings of the 21st Innovative Applications of Artificial Intelligence Conference.

Meuleau N., Neukom C., Plaunt C., Smith D. E. & Smithy T. 2011. The emergency landing planner experiment. In 21st International Conference on Automated Planning and Scheduling.

Muscettola N. 1993. HSTS: integrating planning and scheduling. In Technical Report CMU-RI-TR-93-05, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA.

Sakkout H. E. & Wallace M. 2000. Probe backtrack search for minimal perturbations in dynamic scheduling. Constraints Journal 5(4), 359–388.