Title: The Bottleneck Problem with Minimum Quantity Commitments 
Speaker: Zhou Xu
IEEM, HKUST


Date: Friday, March 4, 2005
Time 11-12
Venue: Room TBA, HKUST


Abstract
Given an edge-distance graph of a set of suppliers and clients, the
bottleneck problem is to assign each client to a selected supplier
minimizing their maximum distance. We introduce minimum quantity commitments
to balance workloads of suppliers, provide the best possible approximation
algorithm, and study its generalizations and specializations.