default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchis Ghate
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Zahra Ghatrani, Archis Ghate
:
Percentile optimization in multi-armed bandit problems. Ann. Oper. Res. 340(2): 837-862 (2024)- [j40]Zahra Ghatrani, Archis Ghate:
Inverse optimization in semi-definite programs to impute unknown constraint matrices. Comput. Oper. Res. 168: 106681 (2024) - [j39]Sivaramakrishnan Ramani, Archis Ghate:
A Family of \(\boldsymbol{s}\)-Rectangular Robust MDPs: Relative Conservativeness, Asymptotic Analyses, and Finite-Sample Properties. SIAM J. Optim. 34(2): 1540-1568 (2024) - 2023
- [j38]Archis Ghate:
Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes. SIAM J. Optim. 33(3): 1391-1415 (2023) - 2022
- [j37]Sivaramakrishnan Ramani, Archis Ghate:
Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets. SIAM J. Optim. 32(2): 989-1017 (2022) - 2021
- [j36]Archis Ghate:
Inverse conic linear programs in Banach spaces. Optim. Lett. 15(2): 289-310 (2021) - [j35]Archis Ghate, Christopher Thomas Ryan, Robert L. Smith:
A Simplex Method for Countably Infinite Linear Programs. SIAM J. Optim. 31(4): 3157-3183 (2021) - 2020
- [j34]Ali Ajdari, Fatemeh Saberian, Archis Ghate:
A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy. INFORMS J. Comput. 32(4): 930-951 (2020) - [j33]Archis Ghate:
Robust continuous linear programs. Optim. Lett. 14(7): 1627-1642 (2020) - [j32]Archis Ghate:
Inverse optimization in semi-infinite linear programs. Oper. Res. Lett. 48(3): 278-285 (2020)
2010 – 2019
- 2019
- [j31]Sevnaz Nourollahi, Archis Ghate:
Inverse optimization in minimum cost flow problems on countably infinite networks. Networks 73(3): 292-305 (2019) - [c5]Mahshid Salemi Parizi, Archis Ghate:
Weakly Coupled Markov Decision Processes with Imperfect Information. WSC 2019: 3609-3602 - 2018
- [j30]Jakob Kotas, Archis Ghate:
Bayesian learning of dose-response parameters from a cohort under response-guided dosing. Eur. J. Oper. Res. 265(1): 328-343 (2018) - 2017
- [j29]Fatemeh Saberian, Archis Ghate, Minsun Kim:
Spatiotemporally Optimal Fractionation in Radiotherapy. INFORMS J. Comput. 29(3): 422-437 (2017) - [j28]Sevnaz Nourollahi, Archis Ghate:
Duality in convex minimum cost flow problems on infinite networks and hypernetworks. Networks 70(2): 98-115 (2017) - [j27]Mahshid Salemi Parizi, Yasin Gocgun, Archis Ghate:
Approximate policy iteration for dynamic resource-constrained project scheduling. Oper. Res. Lett. 45(5): 442-447 (2017) - [j26]Archis Ghate:
Duality in Countably Infinite Monotropic Programs. SIAM J. Optim. 27(3): 2010-2033 (2017) - 2016
- [j25]Mahshid Salemi Parizi, Archis Ghate:
Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking. Comput. Oper. Res. 67: 90-101 (2016) - [j24]Archis Ghate:
Robust optimization in countably infinite linear programs. Optim. Lett. 10(4): 847-863 (2016) - [j23]Saumya Sinha, Archis Ghate:
Policy iteration for robust nonstationary Markov decision processes. Optim. Lett. 10(8): 1613-1628 (2016) - [j22]Saumya Sinha, Jakob Kotas, Archis Ghate:
Robust response-guided dosing. Oper. Res. Lett. 44(3): 394-399 (2016) - [j21]Ali Ajdari, Archis Ghate:
Robust spatiotemporally integrated fractionation in radiotherapy. Oper. Res. Lett. 44(4): 544-549 (2016) - [c4]Mahshid Salemi Parizi, Archis Ghate:
Lot-sizing in sequential auctions while learning bid and demand distributions. WSC 2016: 895-906 - [c3]Ali Ajdari, Archis Ghate:
A model predictive control approach for discovering nonstationary fluence-maps in cancer radiotherapy fractionation. WSC 2016: 2065-2075 - 2015
- [j20]Archis Ghate:
Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning. Eur. J. Oper. Res. 245(2): 555-570 (2015) - [j19]Archis Ghate:
Circumventing the Slater conundrum in countably infinite linear programs. Eur. J. Oper. Res. 246(3): 708-720 (2015) - [j18]Archis Ghate:
Inverse optimization in countably infinite linear programs. Oper. Res. Lett. 43(3): 231-235 (2015) - [j17]Fatemeh Saberian, Archis Ghate, Minsun Kim:
A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy. Oper. Res. Lett. 43(3): 254-258 (2015) - [j16]Fatemeh Saberian, Archis Ghate, Minsun Kim:
Corrigendum to "A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy" [Oper. Res. Lett. 43(3) (2015) 254-258]. Oper. Res. Lett. 43(4): 418 (2015) - [j15]Timothy D. Lortz, Irina S. Dolinskaya, Archis Ghate, Robert L. Smith:
Solvability in infinite horizon optimization. Oper. Res. Lett. 43(5): 498-503 (2015) - 2013
- [j14]Archis Ghate, Robert L. Smith:
A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes. Oper. Res. 61(2): 413-425 (2013) - 2012
- [j13]Yasin Gocgun, Archis Ghate:
Lagrangian relaxation and constraint generation for allocation and advanced scheduling. Comput. Oper. Res. 39(10): 2323-2336 (2012) - [j12]Minsun Kim, Archis Ghate, Mark H. Phillips:
A stochastic control formalism for dynamic biologically conformal radiation therapy. Eur. J. Oper. Res. 219(3): 541-556 (2012) - 2011
- [j11]Yasin Gocgun, Brian W. Bresnahan, Archis Ghate, Martin L. Gunn:
A Markov decision process approach to multi-category patient scheduling in a diagnostic facility. Artif. Intell. Medicine 53(2): 73-81 (2011) - [j10]Marina A. Epelman, Archis Ghate, Robert L. Smith:
Sampled fictitious play for approximate dynamic programming. Comput. Oper. Res. 38(12): 1705-1718 (2011) - [j9]Xi Chen, Archis Ghate, Arvind K. Tripathi:
Dynamic lot-sizing in sequential online retail auctions. Eur. J. Oper. Res. 215(1): 257-267 (2011) - [c2]Zelda B. Zabinsky, Wei Wang, Yanto Prasetio, Archis Ghate, Joyce W. Yen:
Adaptive probabilistic branch and bound for level set approximation. WSC 2011: 4151-4162 - 2010
- [j8]Archis Ghate, Dushyant Sharma, Robert L. Smith:
A Shadow Simplex Method for Infinite Linear Programs. Oper. Res. 58(4-Part-1): 865-877 (2010) - [c1]Yasin Gocgun, Archis Ghate:
A Lagrangian approach to Dynamic Resource Allocation. WSC 2010: 3330-3340
2000 – 2009
- 2009
- [j7]Stephen Baumert, Archis Ghate, Seksan Kiatsupaibul, Yanfang Shen, Robert L. Smith, Zelda B. Zabinsky:
Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles. Oper. Res. 57(3): 727-739 (2009) - [j6]Archis Ghate, Robert L. Smith:
Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs. Manuf. Serv. Oper. Manag. 11(2): 362-368 (2009) - [j5]Archis Ghate, Robert L. Smith:
A Hit-and-Run approach for generating scale invariant Small World networks. Networks 53(1): 67-78 (2009) - [j4]Wei Wang, Archis Ghate, Zelda B. Zabinsky:
Adaptive parameterized improving hit-and-run for global optimization. Optim. Methods Softw. 24(4-5): 569-594 (2009) - [j3]Archis Ghate, Robert L. Smith:
Characterizing extreme points as basic feasible solutions in infinite linear programs. Oper. Res. Lett. 37(1): 7-10 (2009) - 2008
- [j2]Archis Ghate, Robert L. Smith:
Adaptive search with stochastic acceptance probabilities for global optimization. Oper. Res. Lett. 36(3): 285-290 (2008) - [j1]Archis Ghate, Robert L. Smith:
A dynamic programming approach to efficient sampling from Boltzmann distributions. Oper. Res. Lett. 36(6): 665-668 (2008)
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-09-21 23:38 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:
