The bottleneck problem with minimum quantity commitments

Andrew Lim, Zhou Xu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)

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 languageEnglish
Pages (from-to)91-100
Number of pages10
JournalNaval Research Logistics
Volume53
Issue number1
DOIs
Publication statusPublished - 1 Feb 2006
Externally publishedYes

Keywords

  • Approximate algorithm
  • Bottleneck problem
  • Minimum quantity commitment

ASJC Scopus subject areas

  • Modelling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Cite this