Problem 1(continued)

5 points 1h) Branch and bound search techniques maintain

generally simpler and smaller data structures than do the most basic back-tracking algorithms.

5 points 1i) Lawler’s approximation algorithm for the 1|rj|Lmax scheduling problem is a fully polynomial approximation scheme. The algorithm is outlined here and on pages 9-10 of the book.

Let B = {Jj: pj > P/k}

• Guess where the jobs of B fit in the job sequence
• Use Jackson’s rule for the other jobs
• Use the best sequence from all O(nk) guesses

True or False

False, branch and bound requires large, complex storage

False, not polynomial in 1/e

Previous slide

Next slide

Back to first slide

View graphic version