On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices
Year of publication: |
2000
|
---|---|
Authors: | Niño Mora, José |
Publisher: |
[S.l.] : SSRN |
Extent: | 1 Online-Ressource (29 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments April 5, 2000 erstellt |
Other identifiers: | 10.2139/ssrn.230871 [DOI] |
Classification: | C60 - Mathematical Methods and Programming. General ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Computing American option prices in the lognormal jump–diffusion framework with a Markov chain
Simonato, Jean-Guy, (2011)
-
Shapley-Based Stackelberg Leadership Formation in Networks
Belik, Ivan, (2015)
-
Approximate Results for a Generalized Secretary Problem
Dietz, Chris, (2010)
- More ...
-
An Intuitive Condition for Stability and Performance Analysis of Multiclass Queueing Networks
Glazebrook, Kevin D., (2004)
-
Bertsimas, Dimitris, (2004)
-
Restless Bandits, Partial Conservation Laws and Indexability
Niño Mora, José, (2015)
- More ...