讨论组:学生讲座
标题:On the Donation Center Location Problem
演讲人: 梁宏宇
时间: 2011-03-17 16:30-2011-03-17 17:30
地点:FIT 1-222

内容:

Imagine that a charitable organization wishes to open some locations where people can make donations (e.g. donate blood). Each center has a capacity for the number of donors they can hold, and each donor has a preference list on the set of locations -- of course, if you want to donate blood, you would be willing to go to a nearer location, or a location that may provide you some small gifts. How to assign the donors to the locations such that every donor is happy and the quality (or number) of received donations is maximized? The Donation Center Location Problem is abstracted from this real scenario. In this talk, I'll formally define the problem, present some known results (complexity and approximation algorithm) for it, and give some open questions that (hopefully) may become your next research problem.