This preview shows page 1. Sign up to view the full content.
Unformatted text preview: F . (c) Set up the covering clause for F and solve it using Patricks method. 3. Using the Branch algorithm, nd a minimum cover and construct a decision tree for the following covering matrix. Also for each minimum cover, give the corresponding selection and status vectors, i.e., the vector x and y from Ax = y (lecture slide 1020). Always choose the leftmost column for branching. (hint: this problem requires branching.) 1 0 0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 0...
View
Full
Document
This note was uploaded on 02/19/2010 for the course ECE 3060 taught by Professor Shimmel during the Spring '07 term at Georgia Institute of Technology.
 Spring '07
 Shimmel

Click to edit the document details