Lecture17 - IE 495 Lecture 17 Reading for This Lecture...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 NP-complete problem. Exact Solution Method We cannot hope for a polynomial-time 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

{[ snackBarMessage ]}

Page1 / 17

Lecture17 - IE 495 Lecture 17 Reading for This Lecture...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online