| Article ID: | iaor20072655 |
| Country: | United States |
| Volume: | 53 |
| Issue: | 1 |
| Start Page Number: | 91 |
| End Page Number: | 100 |
| Publication Date: | Feb 2006 |
| Journal: | Naval Research Logistics |
| Authors: | Lim Andrew, Xu Zhou |
| Keywords: | graphs, programming: transportation |
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.