José Niño-Mora

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 5

Top Topics

Target Tracking

Top Venues

Comput. Oper. Res.

Math. Oper. Res.

Publications

Yuhang Hao, Zengfu Wang, José Niño-Mora, Jing Fu, Min Yang, Quan Pan
Non-myopic Beam Scheduling for Multiple Smart Target Tracking in Phased Array Radar Network. CoRR (2023)
José Niño-Mora
Solving Poisson's equation for birth-death chains: Structure, instability, and accurate approximation. Perform. Evaluation 145 (2021)
José Niño-Mora
A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits. Math. Oper. Res. 45 (2) (2020)
José Niño-Mora
Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization. Comput. Oper. Res. 103 (2019)
José Niño-Mora
Whittle's Index Policy for Multi-Target Tracking with Jamming and Nondetections. ASMTA (2016)
José Niño-Mora
Overcoming numerical instability in one-step policy improvement for admission and routing to queues with firm deadlines. NetGCooP (2014)
José Niño-Mora
A Dynamic Page-Refresh Index Policy for Web Crawlers. ASMTA (2014)
José Niño-Mora
Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies. Eur. J. Oper. Res. 220 (3) (2012)
José Niño-Mora
Index-based dynamic energy management in a multimode sensor network. NetGCooP (2012)
José Niño-Mora
Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policies. Comput. Oper. Res. 39 (12) (2012)
José Niño-Mora, Sofia S. Villar
Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy. NetGCoop (2011)
José Niño-Mora
Index-Based Admission Control and Load Balancing of Firm Real-Time Jobs in Multi-clusters. HPCC (2011)
José Niño-Mora
Computing a Classic Index for Finite-Horizon Bandits. INFORMS J. Comput. 23 (2) (2011)
José Niño-Mora
Index policies for admission and routing of soft real-time traffic to parallel queues. SIGMETRICS Perform. Evaluation Rev. 38 (2) (2010)
José Niño-Mora
A Restless Bandit Marginal Productivity Index for Opportunistic Spectrum Access with Sensing Errors. NET-COOP (2009)
José Niño-Mora, Sofia S. Villar
Multitarget tracking via restless bandit marginal productivity indices and Kalman filter in discrete time. CDC (2009)
José Niño-Mora
A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups. NET-COOP (2008)
José Niño-Mora
An index policy for multiarmed multimode restless bandits. VALUETOOLS (2008)
José Niño-Mora
Computing an index policy for multiarmed bandits with deadlines. VALUETOOLS (2008)
Peter Jacko, José Niño-Mora
Admission control and routing to parallel queues with delayed information via marginal productivity indices. VALUETOOLS (2008)
José Niño-Mora
A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs. INFORMS J. Comput. 20 (2) (2008)
Peter Jacko, José Niño-Mora
Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract). Electron. Notes Discret. Math. 28 (2007)
José Niño-Mora
Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging. NET-COOP (2007)
José Niño-Mora
Computing an index policy for bandits with switching penalties. VALUETOOLS (2007)
José Niño-Mora
Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain. INFORMS J. Comput. 19 (4) (2007)
José Niño-Mora
Characterization and computation of restless bandit marginal productivity indices. VALUETOOLS (2007)
José Niño-Mora
Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue. Queueing Syst. Theory Appl. 54 (4) (2006)
José Niño-Mora
Queues. Math. Oper. Res. 31 (1) (2006)
José Niño-Mora
A Marginal Productivity Index Policy for the Finite-Horizon Multiarmed Bandit Problem. CDC/ECC (2005)
José Niño-Mora
Marginal productivity index policies for scheduling restless bandits with switching penalties. Algorithms for Optimization with Incomplete Information (2005)
P. S. Ansell, Kevin D. Glazebrook, José Niño-Mora, M. O'Keeffe
Whittle's index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57 (1) (2003)
José Niño-Mora
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Math. Program. 93 (3) (2002)
Kevin D. Glazebrook, José Niño-Mora
Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance. Oper. Res. 49 (4) (2001)
Dimitris Bertsimas, José Niño-Mora
Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic. Oper. Res. 48 (1) (2000)
Kevin D. Glazebrook, José Niño-Mora
A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks. Ann. Oper. Res. 92 (1999)
P. S. Ansell, Kevin D. Glazebrook, Isi Mitrani, José Niño-Mora
A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints. J. Oper. Res. Soc. 50 (7) (1999)
Kevin D. Glazebrook, José Niño-Mora
Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule. ESA (1997)
Dimitris Bertsimas, José Niño-Mora
Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems. Math. Oper. Res. 21 (2) (1996)
Dimitris Bertsimas, José Niño-Mora
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. IPCO (1993)