default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSameh Al-Shihabi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Sameh Al-Shihabi
:
An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic. Eur. J. Oper. Res. 320(3): 496-504 (2025)- 2022
- [j9]Sameh Al-Shihabi, Nenad Mladenovic:
A mixed integer linear programming model and a basic variable neighbourhood search algorithm for the repatriation scheduling problem. Expert Syst. Appl. 198: 116728 (2022) - [j8]Dana I. Abu-Abdoun, Sameh Al-Shihabi:
Weather Conditions and COVID-19 Cases: Insights from the GCC Countries. Intell. Syst. Appl. 15: 200093 (2022) - 2021
- [j7]Yiyuan Wang, Shiwei Pan, Sameh Al-Shihabi, Junping Zhou, Nan Yang, Minghao Yin:
An improved configuration checking-based algorithm for the unicost set covering problem. Eur. J. Oper. Res. 294(2): 476-491 (2021) - [c11]Dana I. Abu-Abdoun, Sameh Al-Shihabi:
The Effects of Weather Conditions on COVID-19 Forecasting, the United Arab Emirates as a Reliable Study Case. DeSE 2021: 50-55 - [c10]Sameh Al-Shihabi:
Optimizing a Binary Integer Program by Identifying Its Optimal Core Problem - A New Optimization Concept Applied to the Multidimensional Knapsack Problem. MCO 2021: 28-39 - [c9]Sameh Al-Shihabi, Dana I. Abu-Abdoun:
What to Forecast When Forecasting New Covid-19 Cases? Jordan and the United Arab Emirates as Case Studies. MCO 2021: 361-372 - 2020
- [j6]Sameh Al-Shihabi, Mohammad M. Aldurgam:
The contractor time-cost-credit trade-off problem: integer programming model, heuristic solution, and business insights. Int. Trans. Oper. Res. 27(6): 2841-2877 (2020)
2010 – 2019
- 2019
- [c8]Sameh Al-Shihabi:
Ants for Identifying and Optimizing the Core Set K-Covering Problem. CEC 2019: 2552-2558 - 2017
- [j5]Sameh Al-Shihabi, Mohammad M. Aldurgam:
A max-min ant system for the finance-based scheduling problem. Comput. Ind. Eng. 110: 264-276 (2017) - 2016
- [j4]Sameh Al-Shihabi:
A hybrid of max-min ant system and linear programming for the k-covering problem. Comput. Oper. Res. 76: 1-11 (2016) - 2015
- [j3]Sameh Al-Shihabi, Mazen Arafeh, Mahmoud A. Barghash:
An improved hybrid algorithm for the set covering problem. Comput. Ind. Eng. 85: 328-334 (2015) - 2014
- [j2]Maram Shqair, Safwan Altarazi, Sameh Al-Shihabi:
A statistical study employing agent-based modeling to estimate the effects of different warehouse parameters on the distance traveled in warehouses. Simul. Model. Pract. Theory 49: 122-135 (2014) - 2011
- [c7]Tamara Jaber, Alaa Horani, Rana Nazzal, Sameh Al-Shihabi:
Selecting the best supplier based on a multi-criteria taguchi loss function: a simulation optimization approach. WSC 2011: 4285-4293 - 2010
- [j1]Sameh Al-Shihabi, Sigurdur Ólafsson:
A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem. Comput. Oper. Res. 37(2): 247-255 (2010)
2000 – 2009
- 2008
- [c6]Maysa Ammouri, Sameh Al-Shihabi:
Selecting Technical Indicators to be Used by an Artificial Neural Network for Stocks' Trends Prediction. DMIN 2008: 249-252 - 2007
- [c5]Sameh Al-Shihabi, Peter Merz, Steffen Wolf:
Nested Partitioning for the Minimum Energy Broadcast Problem. LION 2007: 1-11 - 2006
- [c4]Hadeel D. Idrees, Mahdy O. Sinnokrot, Sameh Al-Shihabi:
A reinforcement learning algorithm to minimize the mean tardiness of a single machine with controlled capacity. WSC 2006: 1765-1769 - 2005
- [c3]Sameh Al-Shihabi:
Subcontracting in a make-to-stock production system, IPA gradients for an SFM. WSC 2005: 819-824 - 2004
- [c2]Sameh Al-Shihabi:
Backtracking Ant System for the Traveling Salesman Problem. ANTS Workshop 2004: 318-325 - [c1]Sameh Al-Shihabi:
Ants for Sampling in the Nested Partition Algorithm. Hybrid Metaheuristics 2004: 11-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
