Hamed Samarghandi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▶ publications with no particular coauthor community group

> Home > Persons > Hamed Samarghandi

Publications

2021
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/PazokiS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/PazokiS21
Mostafa Pazoki, Hamed Samarghandi:
Word-Of-Mouth and estimating demand based on network structure and epidemic models. Eur. J. Oper. Res. 291(1): 323-334 (2021)
2017
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/SamarghandiB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/SamarghandiB17
Hamed Samarghandi, Mehdi Behroozi:
On the exact solution of the no-wait flow shop problem with due date constraints. Comput. Oper. Res. 81: 141-159 (2017)
2014
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcim/SamarghandiE14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcim/SamarghandiE14
Hamed Samarghandi, Tarek Y. ElMekkawy:
Solving the no-wait flow-shop problem with sequence-dependent set-up times. Int. J. Comput. Integr. Manuf. 27(3): 213-228 (2014)
2010
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/SamarghandiE10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/SamarghandiE10
Hamed Samarghandi, Kourosh Eshghi:
An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205(1): 98-105 (2010)

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.