default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Eshragh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Alvaro Sierra-Altamiranda, Hadi Charkhgard
, Iman Dayarian, Ali Eshragh, Sorna Javadi:
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming. Optim. Lett. 18(9): 2051-2078 (2024)- [i9]Ali Eshragh, Luke Yerbury, Asef Nazari, Fred Roosta, Michael W. Mahoney:
SALSA: Sequential Approximate Leverage-Score Algorithm with Application in Analyzing Big Time Series Data. CoRR abs/2401.00122 (2024) - [i8]George Dunn, Hadi Charkhgard, Ali Eshragh, Sasan Mahmoudinazlou, Elizabeth Stojanovski:
Deep Reinforcement Learning for Picker Routing Problem in Warehousing. CoRR abs/2402.03525 (2024) - [i7]Ali Eshragh, Matthew P. Skerritt, Bruno Salvy, Thomas McCallum:
Optimal Experimental Design for Partially Observable Pure Birth Processes. CoRR abs/2402.09772 (2024) - [i6]Sasan Mahmoudinazlou, Abhay Sobhanan, Hadi Charkhgard, Ali Eshragh, George Dunn:
Deep Reinforcement Learning for Dynamic Order Picking in Warehouse Operations. CoRR abs/2408.01656 (2024) - 2022
- [j8]Ali Eshragh, Fred Roosta, Asef Nazari, Michael W. Mahoney:
LSAR: Efficient Leverage Score Sampling Algorithm for the Analysis of Big Time Series Data. J. Mach. Learn. Res. 23: 22:1-22:36 (2022) - [i5]Saed Alizami, Kasun Bandara, Ali Eshragh, Foaad Iravani:
A Hybrid Statistical-Machine Learning Approach for Analysing Online Customer Behavior: An Empirical Study. CoRR abs/2212.02255 (2022) - 2021
- [i4]Ali Eshragh, Oliver Di Pietro, Michael A. Saunders:
Toeplitz Least Squares Problems, Fast Algorithms and Big Data. CoRR abs/2112.12994 (2021) - 2020
- [j7]Ali Eshragh, Jerzy A. Filar, Thomas Kalinowski, Sogol Mohammadian:
Hamiltonian Cycles and Subsets of Discounted Occupational Measures. Math. Oper. Res. 45(2): 713-731 (2020) - [j6]Ali Eshragh, Rasul Esmaeilbeigi, Richard H. Middleton:
An analytical bound on the fleet size in vehicle routing problems: A dynamic programming approach. Oper. Res. Lett. 48(3): 350-355 (2020) - [i3]Vektor Dewanto, George Dunn, Ali Eshragh, Marcus Gallagher, Fred Roosta:
Average-reward model-free reinforcement learning: a systematic review and literature mapping. CoRR abs/2010.08920 (2020)
2010 – 2019
- 2019
- [i2]Alvaro Sierra-Altamiranda, Hadi Charkhgard, Iman Dayarian, Ali Eshragh, Sorna Javadi:
Learning to Project in Multi-Objective Binary Linear Programming. CoRR abs/1901.10868 (2019) - [i1]Ali Eshragh, Rasul Esmaeilbeigi, Richard H. Middleton:
An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach. CoRR abs/1905.05557 (2019) - 2018
- [j5]Behnam Fahimnia, Hoda Davarzani, Ali Eshragh:
Planning of complex supply chains: A performance comparison of three meta-heuristic algorithms. Comput. Oper. Res. 89: 241-252 (2018) - 2016
- [j4]Konstantin Avrachenkov, Ali Eshragh, Jerzy A. Filar:
On transition matrices of Markov chains corresponding to Hamiltonian cycles. Ann. Oper. Res. 243(1-2): 19-35 (2016) - 2015
- [j3]Nigel G. Bean, Robert Elliott, Ali Eshragh, Joshua V. Ross:
On Binomial Observations of Continuous-Time Markovian Population Models. J. Appl. Probab. 52(2): 457-472 (2015) - 2011
- [j2]Ali Eshragh, Jerzy A. Filar, Michael Haythorpe:
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem. Ann. Oper. Res. 189(1): 103-125 (2011) - [j1]Ali Eshragh, Jerzy A. Filar:
Hamiltonian Cycles, Random Walks, and Discounted Occupational Measures. Math. Oper. Res. 36(2): 258-270 (2011) - [c1]Konstantin Avrachenkov, Ali Eshragh, Jerzy A. Filar:
Hamiltonian transition matrices. VALUETOOLS 2011: 463-466
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-11-07 20:36 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:
