default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehdi Serairi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Ala-Eddine Yahiaoui
, Aziz Moukrim, Mehdi Serairi:
GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows. Int. Trans. Oper. Res. 30(2): 946-969 (2023)- 2022
- [c4]Quentin Peña, Aziz Moukrim, Mehdi Serairi:
An Elitist Non-dominated Heuristic Resolution for the Dynamic Asset Protection Problem. EA 2022: 201-214 - 2021
- [j12]Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi:
Exact method for the two-machine flow-shop problem with time delays. Ann. Oper. Res. 298(1): 375-406 (2021) - 2020
- [j11]Racha El-Hajj, Rym Nesrine Guibadj, Aziz Moukrim, Mehdi Serairi:
A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit. Ann. Oper. Res. 291(1): 281-316 (2020)
2010 – 2019
- 2019
- [j10]Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi:
The clustered team orienteering problem. Comput. Oper. Res. 111: 386-399 (2019) - 2018
- [j9]Mehdi Serairi, Mohamed Haouari:
A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem. RAIRO Oper. Res. 52(2): 391 (2018) - 2017
- [c3]Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi:
A branch-and-bound algorithm for the two-machine flow-shop problem with time delays. CoDIT 2017: 690-695 - [c2]Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi:
Hybrid Heuristic for the Clustered Orienteering Problem. ICCL 2017: 19-33 - 2016
- [c1]Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi:
Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays. OR 2016: 527-533 - 2014
- [j8]Anis Kooli, Mehdi Serairi:
A mixed integer programming approach for the single machine problem with unequal release dates. Comput. Oper. Res. 51: 323-330 (2014) - [j7]Aziz Moukrim, Djamal Rebaine, Mehdi Serairi:
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. RAIRO Oper. Res. 48(2): 235-254 (2014) - 2013
- [j6]Ammar Oulamara, Djamal Rebaine, Mehdi Serairi:
Scheduling the two-machine open shop problem under resource constraints for setting the jobs. Ann. Oper. Res. 211(1): 333-356 (2013) - [j5]Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi:
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. Eur. J. Oper. Res. 231(1): 69-78 (2013) - 2011
- [j4]Mohamed Haouari, Mehdi Serairi:
Relaxations and exact solution of the variable sized bin packing problem. Comput. Optim. Appl. 48(2): 345-368 (2011) - 2010
- [j3]Mehdi Serairi, Mohamed Haouari:
A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem. Electron. Notes Discret. Math. 36: 891-897 (2010) - [j2]Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi:
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. Electron. Notes Discret. Math. 36: 1089-1096 (2010)
2000 – 2009
- 2009
- [j1]Mohamed Haouari, Mehdi Serairi:
Heuristics for the variable sized bin-packing problem. Comput. Oper. Res. 36(10): 2877-2884 (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 2025-01-21 00:11 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:
