| Restless bandits, linear programming relaxations, and a primal-dual index heuristic D Bertsimas, J Niño-Mora Operations Research 48 (1), 80-90, 2000 | 291 | 2000 |
| Restless bandits, partial conservation laws and indexability J Nino-Mora Advances in Applied Probability 33 (1), 76-98, 2001 | 258 | 2001 |
| Conservation laws, extended polymatroids and multiarmed bandit problems; a polyhedral approach to indexable systems D Bertsimas, J Nino-Mora Mathematics of Operations Research 21 (2), 257-306, 1996 | 239 | 1996 |
| Dynamic priority allocation via restless bandit marginal productivity indices J Niño-Mora Top 15, 161-198, 2007 | 163 | 2007 |
| Whittle's index policy for a multi-class queueing system with convex holding costs PS Ansell, KD Glazebrook, J Nino-Mora, M O'Keeffe Mathematical Methods of Operations Research 57, 21-39, 2003 | 137 | 2003 |
| Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach J Nino-Mora Mathematical programming 93 (3), 361-413, 2002 | 120 | 2002 |
| Stochastic Scheduling. J Nino-Mora Encyclopedia of optimization 5, 367-372, 2009 | 86 | 2009 |
| The achievable region approach to the optimal control of stochastic systems M Dacre, K Glazebrook, J Niño‐Mora Journal of the Royal Statistical Society: Series B (Statistical Methodology …, 1999 | 74 | 1999 |
| Restless bandit marginal productivity indices, diminishing returns, and optimal control of make-to-order/make-to-stock M/G/1 queues J Niño-Mora Mathematics of Operations Research 31 (1), 50-84, 2006 | 70 | 2006 |
| Computing a classic index for finite-horizon bandits J Nino-Mora INFORMS Journal on Computing 23 (2), 254-267, 2011 | 59 | 2011 |
| Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multi-station case D Bertsimas, J Nino-Mora Mathematics of Operations Research 24 (2), 331-361, 1999 | 57 | 1999 |
| A (2/3) n 3 fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain J Niño-Mora INFORMS Journal on Computing 19 (4), 596-606, 2007 | 52 | 2007 |
| Index policies for a class of discounted restless bandits KD Glazebrook, J Nino-Mora, PS Ansell Advances in Applied Probability 34 (4), 754-774, 2002 | 49 | 2002 |
| Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance KD Glazebrook, J Niño-Mora Operations Research 49 (4), 609-623, 2001 | 47 | 2001 |
| Sensor scheduling for hunting elusive hiding targets via Whittle's restless bandit index policy J Niño-Mora, SS Villar International Conference on NETwork Games, Control and Optimization …, 2011 | 41 | 2011 |
| Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue J Niño-Mora Queueing Systems 54, 281-312, 2006 | 33 | 2006 |
| An index policy for dynamic fading-channel allocation to heterogeneous mobile users with partial observations J Nino-Mora 2008 Next Generation Internet Networks, 231-238, 2008 | 28 | 2008 |
| Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization J Niño-Mora Computers & Operations Research 103, 221-236, 2019 | 26 | 2019 |
| Characterization and computation of restless bandit marginal productivity indices J Niño Mora | 25 | 2007 |
| A restless bandit marginal productivity index for opportunistic spectrum access with sensing errors J Nino-Mora Network Control and Optimization: Third Euro-NF Conference, NET-COOP 2009 …, 2009 | 23 | 2009 |
