This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: MIE335S Lab 07 - SCP Winter 2012 MIE335 Lab 07: Set-Covering Problem 1 Introduction This lab is to provide you with experience with coding a greedy algorithm and to evaluate the penalty using a heuristic compared to an IP. We will compare this using the set-covering problem (SCP) for cases of k-cover. 1.1 Deliverable Submit a single MATLAB m-file that will contain all your functions to complete the lab. Your MATLAB function should take in 3 parameters and return 3 values. The 3 input parameters are the adjacency matrix A , the cost vector C , and the cover k . Your function should return x greedy the solution from greedy implementation, x ip the solution from an IP, diff the absolute percentage difference (0,1) in between the two methods (see below). If an IP is infeasible, return a zero vector and make the absolute difference equal to -1. Your file should be named (in lowercase only) lab07 utorid.m . For example, if this is lab 1 and for UTORid of doejohn, name the file lab01 doejohn.mdoejohn....
View Full Document
- Spring '12
- Greedy algorithm, TA, 1 m, 90%