default search action
Shahin Gelareh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Rahimeh Neamatian Monemi
, Shahin Gelareh
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
- [j10]Rahimeh Neamatian Monemi
Dock assignment and truck scheduling problem; consideration of multiple scenarios with resource allocation constraints. Comput. Oper. Res. 151: 106074 (2023) - [i3]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
- [j9]Rahimeh Neamatian Monemi
Bi-objective load balancing multiple allocation hub location: a compromise programming approach. Ann. Oper. Res. 296(1): 363-406 (2021) - [j8]Shahin Gelareh
A note on "Variable Neighborhood Search Based Algorithms for Crossdock Truck Assignment". RAIRO Oper. Res. 55(5): 2763-2768 (2021) - [j7]Omar Kemmar
Hub location problem in round-trip service applications. RAIRO Oper. Res. 55(Supplement): S2831-S2858 (2021) - [i2]Shahin Gelareh:
A note on 'Variable Neighborhood Search Based Algorithms for Crossdock Truck Assignment'. CoRR abs/2107.03757 (2021) - 2020
- [j6]Shahin Gelareh
The selective traveling salesman problem with draft limits. J. Heuristics 26(3): 339-352 (2020)
2010 – 2019
- 2019
- [b1]Shahin Gelareh:
Habilitation á diriger des recherches Mathematical Modeling and Optimization in Liner Shipping. (Habilitationsschrift zur mathematischen Modellierung und Optimierung in der Linienschifffahrt / Modélisation mathématiques et optimisation dans le transport maritime). University of Lorraine, Nancy, France, 2019 - [j5]Kassem Danach, Shahin Gelareh
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) - [i1]Shahin Gelareh:
A note on 'Collaborative hub location problem under cost uncertainty'. CoRR abs/1910.02044 (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
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
Solution methods for scheduling of heterogeneous parallel machines applied to the workover rig problem. Expert Syst. Appl. 42(9): 4493-4505 (2015) - [c2]Kassem Danach, Jomana Al-Haj Hassan, Wissam Khalil, Shahin Gelareh
Routing heterogeneous mobile hospital with different patients priorities: Hyper-heuristic approach. DICTAP 2015: 155-158 - 2013
- [j1]Shahin Gelareh
Single string planning problem arising in liner shipping industries: A heuristic approach. Comput. Oper. Res. 40(10): 2357-2373 (2013)
2000 – 2009
- 2007
- [c1]Shahin Gelareh, Stefan Nickel:
A Benders Decomposition for Hub Location Problems Arising in Public Transport. OR 2007: 129-134
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:23 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: