Deterministic and Stochastic Dynamic Programming

Michael L. Pinedo ()
Additional contact information
Michael L. Pinedo: New York University

Chapter Appendix B in Scheduling, 2012, pp 573-579 from Springer

Abstract: Abstract Dynamic programming is one of the more widely used techniques for dealing with combinatorial optimization problems. Dynamic Programming can be applied to problems that are solvable in polynomial time, as well as problems that cannot be solved in polynomial time (see Appendix C). It has proven to be very useful for stochastic problems as well

Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-2361-4_22

Ordering information: This item can be ordered from
http://www.springer.com/9781461423614

DOI: 10.1007/978-1-4614-2361-4_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().