default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSlim Belhaiza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Slim Belhaiza
, Salwa Charrad, Rym M'Hallah:
On the impact of corruption on managers' and controllers' behavior. RAIRO Oper. Res. 56(1): 165-181 (2022)- [j12]Ibrahim A. Nemer, Tarek R. Sheltami, Slim Belhaiza, Ashraf S. Mahmoud:
Energy-Efficient UAV Movement Control for Fair Communication Coverage: A Deep Reinforcement Learning Approach. Sensors 22(5): 1919 (2022) - [c4]Slim Belhaiza, Rym M'Hallah, Munirah Al-Qarni:
A Data-Driven Forecasting and Solution Approach for the Dial-A-Ride Problem with Time Windows. SSCI 2022: 101-110 - 2021
- [j11]Slim Belhaiza:
A Branch-and-Bound Algorithm for Polymatrix Games ϵ-Proper Nash Equilibria Computation. Algorithms 14(12): 365 (2021) - 2020
- [j10]Slim Belhaiza, Uthman Baroudi, Issmail Elhallaoui:
A Game Theoretic Model for the Multiperiodic Smart Grid Demand Response Problem. IEEE Syst. J. 14(1): 1147-1158 (2020)
2010 – 2019
- 2019
- [j9]Slim Belhaiza:
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem. Algorithms 12(2): 39 (2019) - [j8]Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim, Gilbert Laporte:
Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows. J. Heuristics 25(3): 485-515 (2019) - 2018
- [j7]Huggo Silva Ferreira, Eduardo T. Bogue, Thiago F. Noronha, Slim Belhaiza, Christian Prins:
Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows. Electron. Notes Discret. Math. 66: 207-214 (2018) - [j6]Slim Belhaiza, Salwa Charrad, Rym M'Hallah:
On the Performance of Managers and Controllers: A Polymatrix Game Approach for the Manager-Controller-Board of Directors' Conflict. J. Optim. Theory Appl. 177(2): 584-602 (2018) - [j5]Slim Belhaiza:
A Game Theoretic Approach for the Real-Life Multiple-Criterion Vehicle Routing Problem With Multiple Time Windows. IEEE Syst. J. 12(2): 1251-1262 (2018) - 2017
- [c3]Slim Belhaiza, Rym M'Hallah, Ghassen Ben Brahim:
A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows. CEC 2017: 1319-1326 - [c2]Slim Belhaiza:
A data driven hybrid heuristic for the dial-a-ride problem with time windows. SSCI 2017: 1-8 - 2016
- [c1]Slim Belhaiza, Rym M'Hallah:
A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. CEC 2016: 3515-3524 - 2015
- [j4]Slim Belhaiza, Uthman Baroudi:
A Game Theoretic Model for Smart Grids Demand Management. IEEE Trans. Smart Grid 6(3): 1386-1393 (2015) - 2014
- [j3]Slim Belhaiza, Pierre Hansen, Gilbert Laporte:
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52: 269-281 (2014) - 2012
- [j2]Slim Belhaiza, Charles Audet, Pierre Hansen:
On proper refinement of Nash equilibria for bimatrix games. Autom. 48(2): 297-303 (2012)
2000 – 2009
- 2009
- [j1]Charles Audet, Slim Belhaiza, Pierre Hansen:
A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games. IGTR 11(4): 437-451 (2009)
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-04-25 05:45 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:
