![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Majid Eskandarpour
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Chandra Ade Irawan
, Stefano Starita
, Hing Kai Chan, Majid Eskandarpour, Mohammad Reihaneh
:
Routing in offshore wind farms: A multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat. Eur. J. Oper. Res. 307(1): 328-350 (2023) - 2022
- [j7]Mohammad Reihaneh
, Mostafa Abouei Ardakan, Majid Eskandarpour:
An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy. Eur. J. Oper. Res. 297(3): 1112-1125 (2022) - 2021
- [j6]Chandra Ade Irawan
, Majid Eskandarpour
, Djamila Ouelhadj
, Dylan F. Jones
:
Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm. Eur. J. Oper. Res. 289(3): 912-926 (2021) - [j5]Majid Eskandarpour, Pierre Dejax, Olivier Péton:
Multi-directional local search for sustainable supply chain network design. Int. J. Prod. Res. 59(2): 412-428 (2021)
2010 – 2019
- 2019
- [j4]Majid Eskandarpour
, Djamila Ouelhadj
, Sara Hatami
, Angel A. Juan
, Banafsheh Khosravi
:
Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges. Eur. J. Oper. Res. 277(2): 479-491 (2019) - 2018
- [j3]Aliakbar Hasani, Majid Eskandarpour, Mohammad Fattahi:
A simulation-based optimisation approach for multi-objective inventory control of perishable products in closed-loop supply chains under uncertainty. Int. J. Adv. Oper. Manag. 10(4): 324-344 (2018) - 2017
- [j2]Majid Eskandarpour
, Pierre Dejax, Olivier Péton
:
A large neighborhood search heuristic for supply chain network design. Comput. Oper. Res. 80: 23-37 (2017) - 2014
- [b1]Majid Eskandarpour:
Generic models and optimization algorithms for sustainable supply chain network design. (Modèles génériques et algorithmes d'optimisation pour la conception des chaînes logistiques durables). École des mines de Nantes, France, 2014 - [j1]Majid Eskandarpour
, Ehsan Nikbakhsh
, Seyed Hessameddin Zegordi:
Variable neighborhood search for the bi-objective post-sales network design problem: A fitness landscape analysis approach. Comput. Oper. Res. 52: 300-314 (2014)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint