default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRym Nesrine Guibadj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b1]Rym Nesrine Guibadj:
Problèmes de tournées de véhicules et application industrielle pour la réduction de l'empreinte écologique. (Vehicule routing problems and industrial application to reduce the ecological footprint). University of Technology of Compiègne, France, 2013
Journal Articles
- 2022
- [j4]Asma Ben-Said
, Aziz Moukrim, Rym Nesrine Guibadj, Jérôme Verny:
Using decomposition-based multi-objective algorithm to solve Selective Pickup and Delivery Problems with Time Windows. Comput. Oper. Res. 145: 105867 (2022) - 2020
- [j3]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) - [j2]Youcef Amarouche, Rym Nesrine Guibadj, Elhadja Chaalal, Aziz Moukrim:
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows. Comput. Oper. Res. 123: 105039 (2020) - 2013
- [j1]Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim:
An effective PSO-inspired algorithm for the team orienteering problem. Eur. J. Oper. Res. 229(2): 332-344 (2013)
Conference and Workshop Papers
- 2023
- [c9]Mehdi El Krari, Rym Nesrine Guibadj, John R. Woodward, Denis Robilliard:
Fairer Comparisons for Travelling Salesman Problem Solutions Using Hash Functions. EvoCOP 2023: 1-15 - 2021
- [c8]Mehdi El Krari, Rym Nesrine Guibadj, John Woodward, Denis Robilliard:
Introducing a hash function for the travelling salesman problem for differentiating solutions. GECCO Companion 2021: 123-124 - 2019
- [c7]Lamiaa Dahite, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj, Cyril Fonlupt:
Optimization of Maintenance Planning and Routing Problems. ICVNS 2019: 95-111 - 2018
- [c6]Youcef Amarouche, Rym Nesrine Guibadj, Aziz Moukrim:
A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem. ATMOS 2018: 11:1-11:15 - 2014
- [c5]Sohaib Afifi, Rym Nesrine Guibadj, Aziz Moukrim:
New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows. CPAIOR 2014: 422-437 - 2013
- [c4]Rym Nesrine Guibadj, Aziz Moukrim:
Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows. Artificial Evolution 2013: 183-194 - 2011
- [c3]Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim:
A PSO-Based Memetic Algorithm for the Team Orienteering Problem. EvoApplications (2) 2011: 471-480 - 2010
- [c2]Thouraya Bouabana-Tebibel, Sara Mehar, Rym Nesrine Guibadj:
Secure information exchange. IRI 2010: 59-62 - [c1]Thouraya Bouabana-Tebibel, Rym Nesrine Guibadj, Sara Mehar:
Secure ad-hoc routing protocol. SEKE 2010: 771-776
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-05-08 21:02 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:
