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.
Original language | English |
---|---|
Pages (from-to) | 91-100 |
Number of pages | 10 |
Journal | Naval Research Logistics |
Volume | 53 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Feb 2006 |
Externally published | Yes |
Keywords
- Approximate algorithm
- Bottleneck problem
- Minimum quantity commitment
ASJC Scopus subject areas
- Modelling and Simulation
- Ocean Engineering
- Management Science and Operations Research