Publications in refereed journals
  1. Niño-Mora, J. (2008). A faster index algorithm and a computational study for bandits with switching costs. INFORMS Journal on Computing, vol. 20, no. 2, 255-269. [pdf].

    2.  
  2. Niño-Mora, J. (2007). Dynamic priority allocation via restless bandit marginal productivity indices. TOP, vol. 15 no. 2, 161-198. Invited review article accompanied by six discussions by I.J.B.F. Adan and O.J. Boxma, E. Altman, O. Hernández-Lerma, R. Weber, P. Whittle, and D.D. Yao, followed by a rejoinder ). [pdf]. (TOP: A Springer Journal of Operations Research created by the Spanish Society of Statistics and Operations Research)

    3.  
  3. Niño-Mora, J. (2007). Marginal productivity index policies for admission control and routing to parallel multi-server loss queues with reneging. Network Control and Optimization: Proceedings of NET-COOP 2007, Lecture Notes in Computer Science, vol. 4465, 138-149, 2007. Springer, Berlin. [pdf]

    4.  
  4. Niño-Mora, J. (2007). A (2/3) n^3 fast-pivoting algorithm for the Gittins index and optimal stopping of a Markov chain. INFORMS Journal on Computing, vol. 19, no. 4, 596-606. [pdf]

    5.  
  5. Niño-Mora, J. (2006). Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue. Queueing Systems, vol. 54 no. 4, 281-312. [pdf]

    6.  
  6. Niño-Mora, J. (2006). Restless bandit marginal productivity indices, diminishing returns and optimal control of make-to-order/make-to-stock M/G/1 queues. Mathematics of Operations Research, vol. 31 no. 1, 50-84. [pdf]

    7.  
  7. Niño-Mora, J. (2002). Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Mathematical Programming, Series A, vol. 93 no. 3, 361-413. [pdf]

    8.  
  8. Niño-Mora, J. (2001). Restless bandits, partial conservation laws and indexability. Advances in Applied Probability, vol. 33 no. 1, 76-98. [pdf]

    9.  
  9. Ansell, P. S., Glazebrook, K., Niño-Mora, J., and O'Keeffe (2003). Whittle's index policy for a multi-class queueing system with convex holding costs . Mathematical Methods of Operations Research, vol. 57, 21-39.

    10.  
  10. Glazebrook, K. D., Niño-Mora, J. and Ansell, P. S. (2002). Index policies for a class of discounted restless bandits. Advances in Applied Probability, vol. 34 no. 4, 754-774.

    11.  
  11. Glazebrook, K. and Niño-Mora, J. (2001). Parallel scheduling of multiclass M/M/m queues: approximate and heavy-traffic optimization of achievable performance. Operations Research, vol. 49 no. 4, 609-623.

    12.  
  12. Niño-Mora, J. and Glazebrook, K. (2000). Assessing an intuitive condition for stability under a range of traffic conditions for a generalized Lu-Kumar network. Journal of Applied Probability, vol. 37 no. 3, 890-899.

    13.  
  13. Bertsimas, D. and Niño-Mora, J. (2000). Restless bandits, linear programming relaxations, and a primal-dual index heuristic. Operations Research, vol. 48 no. 1, 80-90.

    14.  
  14. Dacre, M., Glazebrook, K. and Niño-Mora, J. (1999). The achievable region approach to the optimal control of stochastic systems. With discussion. Journal of the Royal Statistical Society, Series B, Methodological, vol. 61 no. 4, 747-791.

    15.  
  15. Glazebrook, K. and Niño-Mora, J. (1999). A linear programming approach to stability, optimization and performance analysis for Markovian multiclass queueing networks. Annals of Operations Research, vol. 92, 1-18.

    16.  
  16. Ansell, P.S., Glazebrook, K.D., Mitrani, I. and Niño-Mora, J. (1999). A semidefinite programming approach to the optimal control of a single-server queueing system with imposed second moment constraints. Journal of the Operational Research Society, vol. 50 no. 7, 765-773.

    17.  
  17. Bertsimas, D. and Niño-Mora, J. (1999). Optimization of multiclass queueing networks with changeover times via the achievable region approach: part I, the single-station case. Mathematics of Operations Research, vol. 24 no. 2, 306-330.

    18.  
  18. Bertsimas, D. and Niño-Mora, J. (1999). Optimization of multiclass queueing networks with changeover times via the achievable region approach: part II, the multi-station case. Mathematics of Operations Research, vol. 24 no. 2, 331-361.

    19.  
  19. Bertsimas, D. and Niño-Mora, J. (1996). Conservation laws, extended polymatroids and multiarmed bandit problems: a polyhedral approach to indexable systems. Mathematics of Operations Research, vol. 21 no. 2, 257-306.
    20.