The Bottleneck Problem with Minimum Quantity Commitments

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 it a 3-approximation algorithm, and study its generalizations.

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Andrew Lim, Zhou Xu
• Keywords: Algorithms, Bottleneck Problem, Edge-distance Graph, Minimum Quantity Commitments, SWAT 2004