Example: marketing
Chapter 11 Dynamic Programming - Unicamp

Chapter 11 Dynamic Programming - Unicamp

Back to document page

1This problem also can be formulated as a shortest-path problem(see Sec. 9.3), where costs here play the role of distances in the shortest-path problem. The algorithm presented in Sec. 9.3 actually uses the philosophy of dynamic programming. However, because the present problem has a fixed number of stages, the dynamic pro-

  Roles

Download Chapter 11 Dynamic Programming - Unicamp


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries