The bottleneck problem with minimum quantity commitments

The bottleneck problem with minimum quantity commitments

0.00 Avg rating0 Votes
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: ,
Keywords: graphs, programming: transportation
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.

Reviews

Required fields are marked *. Your email address will not be published.