![]() | ![]() |
| 2012 | ||
|---|---|---|
| 10 | Zahir Irani, Vishanth Weerakkody, Muhammad Mustafa Kamal, Nitham Mohammed Hindi, Ibrahim H. Osman, Abdel Latef Anouze, Ramzi El-Haddadeh, Habin Lee, Mohamad Osmani, Baydaa Al-Ayoubi: An analysis of methodologies utilised in e-government research: A user satisfaction perspective. J. Enterprise Inf. Management 25(3): 298-313 (2012) | |
| 2011 | ||
| 9 | Ibrahim H. Osman, Lynn N. Berbary, Yusuf Sidani, Baydaa Al-Ayoubi, Ali Emrouznejad: Data Envelopment Analysis Model for the Appraisal and Relative Performance Evaluation of Nurses at an Intensive Care Unit. J. Medical Systems 35(5): 1039-1062 (2011) | |
| 2009 | ||
| 8 | 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 | ||
| 7 | 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) | |
| 6 | Hassan Ghaziri, Ibrahim H. Osman: Self-organizing feature maps for the vehicle routing problem with backhauls. J. Scheduling 9(2): 97-114 (2006) | |
| 2005 | ||
| 5 | 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 | ||
| 4 | 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) | |
| 3 | Ibrahim H. Osman, Khalil S. Hindi: Editorial. J. Math. Model. Algorithms 3(3): 179-181 (2004) | |
| 1999 | ||
| 2 | Ibrahim H. Osman: A Unified-Metaheuristic Framework. IEA/AIE 1999: 11-12 | |
| 1997 | ||
| 1 | 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) | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page