default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKourosh Eshghi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j28]Leyla Ahmadpour, Rashed Sahraeian, Kourosh Eshghi:
Resilient downstream oil supply chain under interdiction and recovery resources allocation using a Column and Constraint Generation algorithm. Comput. Oper. Res. 177: 106978 (2025)- 2024
- [j27]Pardis Seyedi, Kourosh Eshghi, Michael W. Carter:
A paradigm shift in appointment Scheduling: Introducing a decentralized integrated Online booking system. Expert Syst. Appl. 257: 124836 (2024) - 2022
- [j26]Bahare Mahmoudi, Kourosh Eshghi
:
Energy-constrained multi-visit TSP with multiple drones considering non-customer rendezvous locations. Expert Syst. Appl. 210: 118479 (2022) - [j25]Maryam Radman, Kourosh Eshghi:
A novel decomposition approach to set covering problems by exploiting special structures. Int. J. Math. Oper. Res. 21(2): 254-279 (2022) - 2021
- [j24]Abolfazl Taghavi, Sharif Khaleghparast, Kourosh Eshghi:
Optimal Agent Framework: A Novel, Cost-Effective Model Articulation to Fill the Integration Gap between Agent-Based Modeling and Decision-Making. Complex. 2021: 6642160:1-6642160:30 (2021) - [j23]Maryam Rezapour Niari, Kourosh Eshghi, Omid Fatahi Valilai:
Topology analysis of manufacturing service supply-demand hyper-network considering QoS properties in the cloud manufacturing system. Robotics Comput. Integr. Manuf. 72: 102205 (2021)
2010 – 2019
- 2019
- [j22]Maryam Radman, Kourosh Eshghi:
A framework to exploit the structure of and solve set packing problems with a semi-block-angular structure. Comput. Ind. Eng. 137 (2019) - 2018
- [j21]Mohammad Hassan Salmani, Kourosh Eshghi:
Using Chemotherapy Science Algorithm (CSA) to Solve the Knapsack Problem. Int. J. Energy Optim. Eng. 7(1): 86-103 (2018) - [j20]Mohammad Amini, Kourosh Eshghi:
Constraint programming models and population-based simulated annealing algorithm for finding graceful and $$\alpha $$ α -labeling of quadratic graphs. Iran J. Comput. Sci. 1(3): 155-164 (2018) - [j19]Maryam Radman, Kourosh Eshghi:
Designing a multi-service healthcare network based on the impact of patients' flow among medical services. OR Spectr. 40(3): 637-678 (2018) - 2017
- [j18]Mohammad Hassan Salmani, Kourosh Eshghi:
A Smart Structural Algorithm (SSA) Based on Infeasible Region to Solve Mixed Integer Problems. Int. J. Appl. Metaheuristic Comput. 8(1): 24-44 (2017) - 2016
- [j17]Niloufar Izadinia, Kourosh Eshghi:
A robust mathematical model and ACO solution for multi-floor discrete layout problem with uncertain locations and demands. Comput. Ind. Eng. 96: 237-248 (2016) - [j16]Saman Eskandarzadeh, Kourosh Eshghi, Mohsen Bahramgiri:
Risk shaping in production planning problem with pricing under random yield. Eur. J. Oper. Res. 253(1): 108-120 (2016) - 2014
- [j15]Niloufar Izadinia, Kourosh Eshghi, Mohammad Hassan Salmani:
A robust model for multi-floor layout problem. Comput. Ind. Eng. 78: 127-134 (2014) - [j14]Hossein Neghabi, Kourosh Eshghi, Mohammad Hassan Salmani:
A new model for robust facility layout problem. Inf. Sci. 278: 498-509 (2014) - [j13]Mehdi Najafi, Kourosh Eshghi, Sander de Leeuw:
A dynamic dispatching and routing model to plan/ re-plan logistics activities in response to an earthquake. OR Spectr. 36(2): 323-356 (2014) - 2013
- [j12]Saman Eskandarzadeh, Kourosh Eshghi:
Decision tree analysis for a risk averse decision maker: CVaR Criterion. Eur. J. Oper. Res. 231(1): 131-140 (2013) - 2012
- [j11]S. M. H. Manzour-al-Ajdad, S. Ali Torabi, Kourosh Eshghi:
Single-Source Capacitated Multi-Facility Weber Problem - An iterative two phase heuristic algorithm. Comput. Oper. Res. 39(7): 1465-1476 (2012) - [j10]S. Hamid Mirmohammadi, Kourosh Eshghi:
A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale. Comput. Oper. Res. 39(7): 1771-1778 (2012) - 2011
- [j9]Nima Yazdan Shenas, Abdolhamid Eshraghniaye Jahromi, Kourosh Eshghi:
Shared information in a serial inventory system. Int. J. Adv. Oper. Manag. 3(2): 101-121 (2011) - 2010
- [j8]Hamed Samarghandi, Kourosh Eshghi:
An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205(1): 98-105 (2010) - [j7]Ardavan Asef-Vaziri, Morteza Kazemi, Kourosh Eshghi, Maher Lahmar:
An ant colony system for enhanced loop-based aisle-network design. Eur. J. Oper. Res. 207(1): 110-120 (2010) - [j6]Houra Mahmoudzadeh, Kourosh Eshghi:
A Metaheuristic Approach to the Graceful Labeling Problem. Int. J. Appl. Metaheuristic Comput. 1(4): 42-56 (2010) - [j5]Hamed Yarmand, Kourosh Eshghi:
Sensitivity analysis of Matching Pennies game. Math. Comput. Model. 51(5-6): 722-735 (2010)
2000 – 2009
- 2009
- [j4]Mohsen S. Sajadieh, Kourosh Eshghi:
Sole versus dual sourcing under order dependent lead times and prices. Comput. Oper. Res. 36(12): 3272-3280 (2009) - 2008
- [j3]Kourosh Eshghi, Javad Nematian:
Special classes of mathematical programming models with fuzzy random variables. J. Intell. Fuzzy Syst. 19(2): 131-140 (2008) - 2007
- [c1]Houra Mahmoudzadeh, Kourosh Eshghi:
A Metaheuristic Approach to the Graceful Labeling Problem of Graphs. SIS 2007: 84-91 - 2006
- [j2]Kourosh Eshghi, Morteza Kazemi:
Ant colony algorithm for the shortest loop design problem. Comput. Ind. Eng. 50(4): 358-366 (2006) - 2004
- [j1]Kourosh Eshghi:
Extension of α-labelings of quadratic graphs. Int. J. Math. Math. Sci. 2004(11): 571-578 (2004)
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 2025-02-19 01:48 CET 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:
