Unformatted text preview:

Slide 1Slide 2Slide 3Slide 4Slide 5Slide 6Slide 7Survey DesignThe problem•One company has the certain numbers of products to sell to the customers.•Each customer will receive questions about the product he or she has purchased, the number of the questions for each customers are between Ci and Ci’•For each product j, there must be the between Pj and P’j customers asked about each product j.Question needed to be solved•The company would like to collect maximum number of the questionnaires from the customers about the products.Bipartite Matching•To solve this problem , we need to use Bipartite matching with the maximum flow to solve the problem (The maximum-flow problem means given a flow network , find the a flow of maximum possible value).•(finding the flows of maximum possible value satisfy this problem)• Left node means the customer, right node means the productWe extend to the corresponding Flow network.Ci,Ci’The number or products asking to customersPj, P’jThe number of the customers asked about each productcustomersProducts0,10 means customer won’t receive the question from this product he bought1 means customer will receive the question from this product he bought•The capacity is 0 or 1•I use the ford-Fulkerson algorithm (minus the minimum flow 1)and see if e1 is 0 and is 0•If e1 is 0 , we choose the next edge from S.. 0 or 1E1 minus 1E2 minus


View Full Document

UT Arlington CSE 5311 - Survey Design

Download Survey Design
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Survey Design and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Survey Design 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?