This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: IE 495 Lecture 17 October 26, 2000 Reading for This Lecture Primary Â¡ Horowitz and Sahni, Chapter 8 Search Algorithms Integer Knapsack Problem We are given n objects. Each object has a weight w i and a profit p i . We also have a knapsack with capacity M . Objective : Fill the knapsack as profitably as possible. We do not allow fractional objects. This is an NPcomplete problem. Exact Solution Method We cannot hope for a polynomialtime algorithm for this problem. How do we solve it? What is the complexity? Heuristic Methods Heuristic methods derive an approximate solution quickly (usually polynomial time). Heuristic for the Knapsack Problem. Performance guarantees. The Bin Packing Problem We are given a set of n items, each with a size/weight w i We are also given a set of bins of capacity C . Bin Packing Problem : Pack the items into the smallest number of bins possible....
View
Full
Document
This note was uploaded on 08/06/2008 for the course IE 495 taught by Professor Linderoth during the Fall '08 term at Lehigh University .
 Fall '08
 Linderoth
 Operations Research

Click to edit the document details