Archis Ghate

Orcid: 0000-0001-6093-5340

According to our database1, Archis Ghate authored at least 43 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes.
SIAM J. Optim., September, 2023

2022
Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets.
SIAM J. Optim., 2022

2021
A Simplex Method for Countably Infinite Linear Programs.
SIAM J. Optim., 2021

Inverse conic linear programs in Banach spaces.
Optim. Lett., 2021

2020
Inverse optimization in semi-infinite linear programs.
Oper. Res. Lett., 2020

Robust continuous linear programs.
Optim. Lett., 2020

A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy.
INFORMS J. Comput., 2020

2019
Inverse optimization in minimum cost flow problems on countably infinite networks.
Networks, 2019

Weakly Coupled Markov Decision Processes with Imperfect Information.
Proceedings of the 2019 Winter Simulation Conference, 2019

2018
Bayesian learning of dose-response parameters from a cohort under response-guided dosing.
Eur. J. Oper. Res., 2018

2017
Duality in Countably Infinite Monotropic Programs.
SIAM J. Optim., 2017

Approximate policy iteration for dynamic resource-constrained project scheduling.
Oper. Res. Lett., 2017

Duality in convex minimum cost flow problems on infinite networks and hypernetworks.
Networks, 2017

Spatiotemporally Optimal Fractionation in Radiotherapy.
INFORMS J. Comput., 2017

2016
Robust response-guided dosing.
Oper. Res. Lett., 2016

Robust spatiotemporally integrated fractionation in radiotherapy.
Oper. Res. Lett., 2016

Policy iteration for robust nonstationary Markov decision processes.
Optim. Lett., 2016

Robust optimization in countably infinite linear programs.
Optim. Lett., 2016

Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking.
Comput. Oper. Res., 2016

Lot-sizing in sequential auctions while learning bid and demand distributions.
Proceedings of the Winter Simulation Conference, 2016

A model predictive control approach for discovering nonstationary fluence-maps in cancer radiotherapy fractionation.
Proceedings of the Winter Simulation Conference, 2016

2015
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., 2015

A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy.
Oper. Res. Lett., 2015

Solvability in infinite horizon optimization.
Oper. Res. Lett., 2015

Inverse optimization in countably infinite linear programs.
Oper. Res. Lett., 2015

Circumventing the Slater conundrum in countably infinite linear programs.
Eur. J. Oper. Res., 2015

Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning.
Eur. J. Oper. Res., 2015

2013
A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes.
Oper. Res., 2013

2012
A stochastic control formalism for dynamic biologically conformal radiation therapy.
Eur. J. Oper. Res., 2012

Lagrangian relaxation and constraint generation for allocation and advanced scheduling.
Comput. Oper. Res., 2012

2011
Dynamic lot-sizing in sequential online retail auctions.
Eur. J. Oper. Res., 2011

Sampled fictitious play for approximate dynamic programming.
Comput. Oper. Res., 2011

A Markov decision process approach to multi-category patient scheduling in a diagnostic facility.
Artif. Intell. Medicine, 2011

Adaptive probabilistic branch and bound for level set approximation.
Proceedings of the Winter Simulation Conference 2011, 2011

2010
A Shadow Simplex Method for Infinite Linear Programs.
Oper. Res., 2010

A Lagrangian approach to Dynamic Resource Allocation.
Proceedings of the 2010 Winter Simulation Conference, 2010

2009
Characterizing extreme points as basic feasible solutions in infinite linear programs.
Oper. Res. Lett., 2009

Adaptive parameterized improving hit-and-run for global optimization.
Optim. Methods Softw., 2009

A Hit-and-Run approach for generating scale invariant Small World networks.
Networks, 2009

Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs.
Manuf. Serv. Oper. Manag., 2009

Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles.
Oper. Res., 2009

2008
A dynamic programming approach to efficient sampling from Boltzmann distributions.
Oper. Res. Lett., 2008

Adaptive search with stochastic acceptance probabilities for global optimization.
Oper. Res. Lett., 2008


  Loading...