Skip to main content
SpringerLink
Log in

Comments on: Dynamic priority allocation via restless bandit marginal productivity indices

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Chen H, Yao DD (2001) Fundamentals of queueing networks: performance, asymptotics and optimization. Springer, New York

    Google Scholar 

  • Fleischer L (2000) Recent progress in submodular function minimization. OPTIMA: Math Program Soc Newsl 64:1–11

    Google Scholar 

  • McCormick T (2007) Submodular function minimization. In: Handbooks on discrete optimization, preprint.

  • Topkis DM (1978) Minimizing a submodular function on a lattice. Oper Res 26:305–321

    Article  Google Scholar 

  • Ye H, Yao DD (2008) Heavy-traffic optimality of a stochastic network under utility-maximizing resource control. Oper Res (to appear)

Download references

Author information

Authors and Affiliations

  1. IEOR Dept, Columbia University, 302 Mudd Bldg, MC 4704, New York, NY, 10027, USA

    David D. Yao

Authors
  1. David D. Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David D. Yao.

Additional information

This comment refers to the invited paper available at: http://dx.doi.org/10.1007/s11750-007-0025-0.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yao, D.D. Comments on: Dynamic priority allocation via restless bandit marginal productivity indices. TOP 15, 220–223 (2007). https://doi.org/10.1007/s11750-007-0031-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-007-0031-2

Keywords

Search

Navigation