DOC PREVIEW
MSU
CSE 830 -
Dynamic Programming Problems
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Unformatted text preview:
View Full Document
Trading Post ProblemBook Stacking ProblemTrading Post Problem•Input–n trading posts on a river–R(i,j) is the cost for renting at post i and returning at post j for i < j•Note, cannot paddle upstream so i < j•Task–Output minimum cost route to get from trading post 1 to trading post nBook Stacking Problem•Input–n books with heights hi and thicknesses ti–length of shelf L•Task–Assignment of books to shelves minimizing sum of heights of tallest book on each shelf•books must be stored in order to conform to catalog system (i.e. books on first shelf must be 1 through i, books on second shelf i+1 through k,
View Full Document
Unlocking...