Premium
The bottleneck problem with minimum quantity commitments
Author(s) -
Lim Andrew,
Xu Zhou
Publication year - 2006
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20126
Subject(s) - bottleneck , computer science , mathematical optimization , enhanced data rates for gsm evolution , graph , set (abstract data type) , operations research , balance (ability) , mathematics , theoretical computer science , artificial intelligence , medicine , programming language , physical medicine and rehabilitation , embedded system
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