Ghate Archis

Archis Ghate

Information about the author Archis Ghate will soon be added to the site.
Found 11 papers in total
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
Duality in convex minimum cost flow problems on infinite networks and hypernetworks
2017
Minimum cost flow problems on infinite networks arise, for example, in...
Spatiotemporally Optimal Fractionation in Radiotherapy
Spatiotemporally Optimal Fractionation in Radiotherapy
2017
We present a spatiotemporally integrated formulation of the optimal fractionation...
Policy iteration for robust nonstationary Markov decision processes
Policy iteration for robust nonstationary Markov decision processes
2016
Policy iteration is a well‐studied algorithm for solving stationary Markov...
Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking
Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking
2016
We investigate a class of scheduling problems where dynamically and stochastically...
Lagrangian relaxation and constraint generation for allocation and advanced scheduling
Lagrangian relaxation and constraint generation for allocation and advanced scheduling
2012
Diverse applications in manufacturing, logistics, health care, telecommunications, and...
A stochastic control formalism for dynamic biologically conformal radiation therapy
A stochastic control formalism for dynamic biologically conformal radiation therapy
2012
State‐of‐the‐art methods for optimizing cancer treatment over...
Dynamic lot‐sizing in sequential online retail auctions
Dynamic lot‐sizing in sequential online retail auctions
2011
Retailers often conduct non‐overlapping sequential online auctions as a revenue...
Sampled fictitious play for approximate dynamic programming
Sampled fictitious play for approximate dynamic programming
2011
Sampled fictitious play (SFP) is a recently proposed iterative learning mechanism for...
A shadow simplex method for infinite linear programs
A shadow simplex method for infinite linear programs
2010
We present a simplex-type algorithm–that is, an algorithm that moves from one...
A dynamic programming approach to efficient sampling from Boltzmann distributions
A dynamic programming approach to efficient sampling from Boltzmann distributions
2008
Markov chain methods for Boltzmann sampling work in phases with decreasing...
Characterizing extreme points as basic feasible solutions in infinite linear programs
Characterizing extreme points as basic feasible solutions in infinite linear programs
2009
Unlike in finite dimensions, a basic feasible solution characterization of extreme...
Papers per page: