default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdelkader Sbihi
Person information
- affiliation: École de management de Normandie, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Marwa Al Samrout, Abdelkader Sbihi
, Adnan Yassine:
An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model. Comput. Oper. Res. 161: 106409 (2024)- [c4]Marwa Al Samrout, Abdelkader Sbihi, Adnan Yassine:
Solving an Integrated Bi-objective Container Terminal Integrated Planning with Transshipment Operations. MIC (2) 2024: 380-386 - 2023
- [j12]Mustapha Hrouga, Abdelkader Sbihi:
Logistics 4.0 for supply chain performance: perspectives from a retailing case study. Bus. Process. Manag. J. 29(6): 1892-1919 (2023) - 2021
- [j11]Tom McNamara, Sabry Shaaban, Abdelkader Sbihi, Zouhair Laarraf:
The operating behaviour of unbalanced, unpaced merging assembly lines. RAIRO Oper. Res. 55(1): 99-113 (2021)
2010 – 2019
- 2019
- [j10]Sara Tfaili, Hamdi Dkhil, Abdelkader Sbihi, Adnan Yassine:
Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph. RAIRO Oper. Res. 53(1): 303-322 (2019) - 2018
- [j9]Abdelkader Sbihi, Makram Chemangui:
A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines. RAIRO Oper. Res. 52(4): 1351-1376 (2018) - [c3]Abdelkader Sbihi:
On Some Smart Hybridized Heuristics and Local Search Programming. ICORES 2018: 9 - [c2]Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba:
Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty. ICORES 2018: 144-151 - [c1]Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba:
An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty. ICORES (Selected Papers) 2018: 153-174 - [e1]Jaouad Boukachour, Abdelkader Sbihi, Ahmed El Hilali Alaoui, Youssef Benadada:
4th International Conference on Logistics Operations Management, GOL 2018, Le Havre, France, April 10-12, 2018. IEEE 2018, ISBN 978-1-5386-6772-9 [contents] - 2013
- [j8]Abdelkader Sbihi:
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem. J. Oper. Res. Soc. 64(10): 1461-1473 (2013) - 2010
- [j7]Abdelkader Sbihi, Richard W. Eglese:
Combinatorial optimization and Green Logistics. Ann. Oper. Res. 175(1): 159-175 (2010) - [j6]Abdelkader Sbihi:
A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem. Eur. J. Oper. Res. 202(2): 339-346 (2010)
2000 – 2009
- 2007
- [j5]Abdelkader Sbihi, Richard W. Eglese:
Combinatorial optimization and Green Logistics. 4OR 5(2): 99-116 (2007) - [j4]Abdelkader Sbihi:
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. J. Comb. Optim. 13(4): 337-351 (2007) - 2006
- [j3]Mhand Hifi, M. Michrafy, Abdelkader Sbihi:
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. Comput. Optim. Appl. 33(2-3): 271-285 (2006) - 2004
- [j2]Mhand Hifi, M. Michrafy, Abdelkader Sbihi:
Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55(12): 1323-1332 (2004) - 2003
- [b1]Abdelkader Sbihi:
Les Méthodes Hybrides en Optimisation Combinatoire :Algorithmes Exacts et Heuristiques. (The Hybrid Methods in Combinatorial Optimization: Exact Algorithms and Heuristics). Pantheon-Sorbonne University, Paris, France, 2003 - 2002
- [j1]Mhand Hifi, Slim Sadfi, Abdelkader Sbihi:
An Efficient Algorithm for the Knapsack Sharing Problem. Comput. Optim. Appl. 23(1): 27-45 (2002)
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-10-07 21:18 CEST 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:
