On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices
Download full text from publisher
References listed on IDEAS
- M. Dacre & K. Glazebrook & J. Niño-Mora, 1999. "The achievable region approach to the optimal control of stochastic systems," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 61(4), pages 747-791.
More about this item
KeywordsStochastic scheduling; restless bandits; greedoids; polyhedral methods; conservation laws; achievable region;
- C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2000-05-16 (All new papers)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:456. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (). General contact details of provider: http://www.econ.upf.edu/ .