default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRahimeh Neamatian Monemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Rahimeh Neamatian Monemi
, Shahin Gelareh, Nelson Maculan:
Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic. Comput. Oper. Res. 167: 106604 (2024)- 2023
- [j8]Rahimeh Neamatian Monemi, Shahin Gelareh:
Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints. Comput. Oper. Res. 151: 106074 (2023) - [i1]Rahimeh Neamatian Monemi, Shahin Gelareh:
Dock Assignment and Truck Scheduling Problem; Consideration of Multiple Scenarios with Resource Allocation Constraints. CoRR abs/2311.02609 (2023) - 2021
- [j7]Rahimeh Neamatian Monemi, Shahin Gelareh, Anass Nagih, Dylan Jones:
Bi-objective load balancing multiple allocation hub location: a compromise programming approach. Ann. Oper. Res. 296(1): 363-406 (2021) - 2020
- [j6]Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic:
The selective traveling salesman problem with draft limits. J. Heuristics 26(3): 339-352 (2020)
2010 – 2019
- 2019
- [j5]Kassem Danach, Shahin Gelareh, Rahimeh Neamatian Monemi:
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach. EURO J. Transp. Logist. 8(5): 597-631 (2019) - 2017
- [j4]Rahimeh Neamatian Monemi, Shahin Gelareh:
The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach. Comput. Oper. Res. 88: 91-102 (2017) - 2016
- [j3]Shahin Gelareh, Rahimeh Neamatian Monemi, Frédéric Semet, Gilles Goncalves:
A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints. Eur. J. Oper. Res. 249(3): 1144-1152 (2016) - 2015
- [j2]Rahimeh Neamatian Monemi, Kassem Danach, Wissam Khalil, Shahin Gelareh, Francisco C. Lima Jr., Dario José Aloise:
Solution methods for scheduling of heterogeneous parallel machines applied to the workover rig problem. Expert Syst. Appl. 42(9): 4493-4505 (2015) - 2014
- [b1]Rahimeh Neamatian Monemi:
Fixed cardinality linear ordering problem, polyhedral studies and solution methods. (Problème d'ordre linéaire sous containte de cardinalité, étude polyédrale et méthodes de résolution). Blaise Pascal University, Clermont-Ferrand, France, 2014 - 2013
- [j1]Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson Maculan, David Pisinger:
Single string planning problem arising in liner shipping industries: A heuristic approach. Comput. Oper. Res. 40(10): 2357-2373 (2013)
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:15 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:
