Approximate dynamic programming for high-dimensional resource allocation problems

Warren Buckler Powell, Benjamin Van Roy

Research output: Chapter in Book/Report/Conference proceedingChapter

23 Scopus citations

Abstract

This chapter focuses on presenting a mathematical model for dynamic resource allocation problems and reviews computational methods including approximate dynamic programming that address them. Results from numerical examples are presented to illustrate the potential of ADP for addressing these complex problems.

Original languageEnglish (US)
Title of host publicationHandbook of Learning and Approximate Dynamic Programming
PublisherWiley-IEEE Press
Pages261-283
Number of pages23
ISBN (Electronic)9780470544785
ISBN (Print)047166054X, 9780471660545
DOIs
StatePublished - Jan 1 2004

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Keywords

  • Cities and towns
  • Driver circuits
  • Dynamic programming
  • Dynamic scheduling
  • Heuristic algorithms
  • Mathematical model
  • Resource management

Fingerprint Dive into the research topics of 'Approximate dynamic programming for high-dimensional resource allocation problems'. Together they form a unique fingerprint.

  • Cite this

    Powell, W. B., & Van Roy, B. (2004). Approximate dynamic programming for high-dimensional resource allocation problems. In Handbook of Learning and Approximate Dynamic Programming (pp. 261-283). Wiley-IEEE Press. https://doi.org/10.1109/9780470544785.ch10