 | Monter d'un niveau |
Gerber, M. U., Hertz, A., & Lozin, V. (2004). Stable Sets in Two Subclasses of Banner-Free Graphs. Discrete Applied Mathematics, 132(1-3), 121-136. Lien externe
Gerber, M. U., Hertz, A., & Schindl, D. (2004). P-5-Free Augmenting Graphs and the Maximum Stable Set Problem. Discrete Applied Mathematics, 132(1-3), 109-119. Lien externe
Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J.-S. (2004). New Heuristics for the Vehicle Routing Problem. (Rapport technique n° G-2004-33). Lien externe
Desrosiers, C., Galinier, P., & Hertz, A. (2004). Efficient Algorithms for Finding Critical Subgraphs. (Rapport technique n° G-2004-31). 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
Hertz, A., & Lozin, V. (2004). The Maximum Independent Set Problem and Augmenting Graphs. (Rapport technique n° G-2004-39). Lien externe
Hertz, A., Schindl, D., & Zufferey, N. (2004). Lower Bounding and Tabu Search Procedures for the Frequency Assignment Problem with Polarization Constraints. (Rapport technique n° G-2003-42). Lien externe
