![]() | ![]() |
2009 | ||
---|---|---|
7 | EE | Krzysztof Fleszar, Ibrahim H. Osman, Khalil S. Hindi: A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research 195(3): 803-809 (2009) |
2006 | ||
6 | EE | Ibrahim H. Osman: A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem. Computers & OR 33: 2526-2546 (2006) |
5 | EE | Hassan Ghaziri, Ibrahim H. Osman: Self-organizing feature maps for the vehicle routing problem with backhauls. J. Scheduling 9(2): 97-114 (2006) |
2005 | ||
4 | EE | Samad Ahmadi, Ibrahim H. Osman: Greedy random adaptive memory programming search for the capacitated clustering problem. European Journal of Operational Research 162(1): 30-44 (2005) |
2004 | ||
3 | EE | Samad Ahmadi, Ibrahim H. Osman: Density Based Problem Space Search for the Capacitated Clustering p-Median Problem. Annals OR 131(1-4): 21-43 (2004) |
1999 | ||
2 | Ibrahim H. Osman: A Unified-Metaheuristic Framework. IEA/AIE 1999: 11-12 | |
1997 | ||
1 | EE | Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. Networks 29(3): 161-171 (1997) |
1 | Samad Ahmadi | [3] [4] |
2 | Krzysztof Fleszar | [7] |
3 | Michel Gendreau | [1] |
4 | Hassan Ghaziri | [5] |
5 | Khalil S. Hindi | [7] |
6 | Gilbert Laporte | [1] |
7 | Yazid M. Sharaiha | [1] |