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 it a 3-approximation algorithm, and study its generalizations. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
APA
Lim, A., & Xu, Z. (2004). The bottleneck problem with minimum quantity commitments. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 285–297. https://doi.org/10.1007/978-3-540-27810-8_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free