 | Monter d'un niveau |
Desrosiers, C., Galinier, P., & Hertz, A. (2004). Efficient Algorithms for Finding Critical Subgraphs. (Rapport technique n° G-2004-31). Lien externe
Dzongang, C. F., Galinier, P., & Pierre, S. (mars 2004). A tabu search approach for routing and wavelength assignment in optical networks [Communication écrite]. Workshop on Optimization of Optical Networks, Montréal, Québec. Non disponible
Galinier, P., & Hao, J.-K. (2004). A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3(1), 73-88. Lien externe
Galinier, P., & Hertz, A. (2004). A Survey of Local Search Methods for Graph Coloring. (Rapport technique n° G-2004-37). Lien externe
Galinier, P., Hertz, A., & Zufferey, N. (2004). An Adaptive Memory Algorithm for the k-Colouring Problem. (Rapport technique n° G-2003-35). Lien externe
