The bottleneck problem with minimum quantity commitments

Andrew Lim and Zhou Xu

Naval Research Logistics (NRL), 2006, vol. 53, issue 1, 91-100

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. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006

Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.20126

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:53:y:2006:i:1:p:91-100

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().