![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
José Niño-Mora
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j19]José Niño-Mora
:
Solving Poisson's equation for birth-death chains: Structure, instability, and accurate approximation. Perform. Evaluation 145: 102163 (2021) - 2020
- [j18]José Niño-Mora
:
A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits. Math. Oper. Res. 45(2): 465-496 (2020) - 2019
- [j17]José Niño-Mora
:
Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization. Comput. Oper. Res. 103: 221-236 (2019) - 2012
- [j16]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): 3431-3444 (2012) - [j15]José Niño-Mora
:
Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies. Eur. J. Oper. Res. 220(3): 705-715 (2012) - 2011
- [j14]José Niño-Mora
:
Computing a Classic Index for Finite-Horizon Bandits. INFORMS J. Comput. 23(2): 254-267 (2011) - 2010
- [j13]José Niño-Mora
:
Index policies for admission and routing of soft real-time traffic to parallel queues. SIGMETRICS Perform. Evaluation Rev. 38(2): 21-23 (2010) - 2008
- [j12]José Niño-Mora
:
A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs. INFORMS J. Comput. 20(2): 255-269 (2008) - 2007
- [j11]Peter Jacko
, José Niño-Mora
:
Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract). Electron. Notes Discret. Math. 28: 145-152 (2007) - [j10]José Niño-Mora
:
A (2/3)n3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain. INFORMS J. Comput. 19(4): 596-606 (2007) - 2006
- [j9]José Niño-Mora
:
Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues. Math. Oper. Res. 31(1): 50-84 (2006) - [j8]José Niño-Mora
:
Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue. Queueing Syst. Theory Appl. 54(4): 281-312 (2006) - 2003
- [j7]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): 21-39 (2003) - 2002
- [j6]José Niño-Mora
:
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Math. Program. 93(3): 361-413 (2002) - 2001
- [j5]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): 609-623 (2001) - 2000
- [j4]Dimitris Bertsimas, José Niño-Mora
:
Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic. Oper. Res. 48(1): 80-90 (2000) - 1999
- [j3]Kevin D. Glazebrook, José Niño-Mora:
A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks. Ann. Oper. Res. 92: 1-18 (1999) - [j2]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): 765-773 (1999) - 1996
- [j1]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): 257-306 (1996)
Conference and Workshop Papers
- 2016
- [c18]José Niño-Mora
:
Whittle's Index Policy for Multi-Target Tracking with Jamming and Nondetections. ASMTA 2016: 210-222 - 2014
- [c17]José Niño-Mora
:
A Dynamic Page-Refresh Index Policy for Web Crawlers. ASMTA 2014: 46-60 - [c16]José Niño-Mora:
Overcoming numerical instability in one-step policy improvement for admission and routing to queues with firm deadlines. NetGCooP 2014: 127-134 - 2012
- [c15]José Niño-Mora:
Index-based dynamic energy management in a multimode sensor network. NetGCooP 2012: 92-95 - 2011
- [c14]José Niño-Mora
:
Index-Based Admission Control and Load Balancing of Firm Real-Time Jobs in Multi-clusters. HPCC 2011: 556-562 - [c13]José Niño-Mora, Sofia S. Villar:
Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy. NetGCoop 2011: 1-8 - 2009
- [c12]José Niño-Mora
, Sofia S. Villar:
Multitarget tracking via restless bandit marginal productivity indices and Kalman filter in discrete time. CDC 2009: 2905-2910 - [c11]José Niño-Mora
:
A Restless Bandit Marginal Productivity Index for Opportunistic Spectrum Access with Sensing Errors. NET-COOP 2009: 60-74 - 2008
- [c10]José Niño-Mora
:
A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups. NET-COOP 2008: 78-86 - [c9]José Niño-Mora:
Computing an index policy for multiarmed bandits with deadlines. VALUETOOLS 2008: 13 - [c8]Peter Jacko
, José Niño-Mora
:
Admission control and routing to parallel queues with delayed information via marginal productivity indices. VALUETOOLS 2008: 52 - [c7]José Niño-Mora
:
An index policy for multiarmed multimode restless bandits. VALUETOOLS 2008: 61 - 2007
- [c6]José Niño-Mora
:
Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging. NET-COOP 2007: 138-149 - [c5]José Niño-Mora:
Characterization and computation of restless bandit marginal productivity indices. VALUETOOLS 2007: 74 - [c4]José Niño-Mora:
Computing an index policy for bandits with switching penalties. VALUETOOLS 2007: 76 - 2005
- [c3]José Niño-Mora
:
A Marginal Productivity Index Policy for the Finite-Horizon Multiarmed Bandit Problem. CDC/ECC 2005: 1718-1722 - 1997
- [c2]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: 232-245 - 1993
- [c1]Dimitris Bertsimas, José Niño-Mora:
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. IPCO 1993: 355-384
Reference Works
- 2009
- [r1]José Niño-Mora:
Stochastic Scheduling. Encyclopedia of Optimization 2009: 3818-3824
Informal and Other Publications
- 2023
- [i2]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 abs/2312.07858 (2023) - 2005
- [i1]José Niño-Mora:
Marginal productivity index policies for scheduling restless bandits with switching penalties. Algorithms for Optimization with Incomplete Information 2005
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint