Transcription of Lecture 13: The Knapsack Problem - Electronic Systems
{{id}} {{{paragraph}}}
Example: tourism industry
Lecture 13: The Knapsack Problem - Electronic Systems
Lecture13:TheKnapsack ProblemOutlineofthisLecture Introductionof the0-1 Knapsack Problem . A dynamicprogrammingsolutionto ProblemInformalDescription:We have computed datafilesthatwe wantto store, andwe have available bytesof hassize bytesandtakes wanttoavoidasmuchrecomputingaspossible,s owe wantto finda subsetof filesto storesuchthat Thefileshave combinedsize at most . cannotstorepartsoffiles, it is shouldwe selectthefiles?20-1 Knapsack ProblemFormaldescription:Giventwo -tuplesofpositivenumbers and and , we wishto determinethesubset !#" %$& ' ( *)(offilesto store)thatmaximizes ,+ - . subjectto ,+ - 0/ Remark:Thisis :Try all$ possible subsets .Question:Any solutionbetterthanthebrute-force? solve :If thesubproblemsarenotindependent, , thena , it doesmorework thannecessary!Question:Any bettersolution?
Lecture 13: The Knapsack Problem Outline of this Lecture Introduction of the 0-1 Knapsack Problem. A dynamic programming solution to this problem.
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Loop: A Simple Dynamic Programming, Loop – a Simple Dynamic Programming, Dynamic programming, Lecture slides on dynamic programming based, Knapsack problem, Examples in Dynamic Optimization: Analytic, Examples in Dynamic Optimization: Analytic and Numeric, Objective-C Programming, Objective-C, Android Programming Basics, Dynamic