This paper proposes a dynamic programming algorithm for decision CPM (DCPM) networks. DCPM is a natural, powerful, and general way of handling the discrete-time/cost-tradeoff problem.

Dan Zhang, Daniel Adelman, An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice, Transportation Science, Vol. 43, No. 3 (August 2009), pp. 381-394 ...

View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...