 | Monter d'un niveau |
Bourjolly, J.-M., Laporte, G., & Pesant, G. (2002). An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research, 138(1), 21-28. Lien externe
Dioume, O., Bourjolly, J.-M., Hogue, P., & Pierre, S. (janvier 1995). ECCS-B method for multi-hour dimensioning [Communication écrite]. Regional International Teletraffic Seminar, South Africa. Non disponible
Dioume, O., Bourjolly, J.-M., Hogue, P., & Pierre, S. (1994). The multi-hour dimensioning problem for hierarchical telephone networks: Generalization of the ECCS-B method. (Rapport technique n° CRT-997). Non disponible
Pierre, S., Hyppolite, M.-A., Bourjolly, J.-M., & Dioume, O. (1995). Topological design of computer communication networks using simulated annealing. International Journal for Engineering Applications of Artificial Intelligence, 8(1), 61-69. Lien externe
