The bottleneck problem with minimum quantity commitments

Andrew Lim; Zhou Xu

doi:10.1002/nav.20126

The bottleneck problem with minimum quantity commitments

Andrew Lim, Zhou Xu

Research output: Journal article publication › Journal article › Academic research › peer-review

5 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 language	English
Pages (from-to)	91-100
Number of pages	10
Journal	Naval Research Logistics
Volume	53
Issue number	1
DOIs	https://doi.org/10.1002/nav.20126
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

More information

10.1002/nav.20126

Cite this

@article{f9427a4faf854c1eb60fb743f4251cb0,

title = "The bottleneck problem with minimum quantity commitments",

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.",

keywords = "Approximate algorithm, Bottleneck problem, Minimum quantity commitment",

author = "Andrew Lim and Zhou Xu",

year = "2006",

month = feb,

day = "1",

doi = "10.1002/nav.20126",

language = "English",

volume = "53",

pages = "91--100",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley & Sons Inc.",

number = "1",

}

TY - JOUR

T1 - The bottleneck problem with minimum quantity commitments

AU - Lim, Andrew

AU - Xu, Zhou

PY - 2006/2/1

Y1 - 2006/2/1

N2 - 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.

AB - 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.

KW - Approximate algorithm

KW - Bottleneck problem

KW - Minimum quantity commitment

UR - http://www.scopus.com/inward/record.url?scp=33645698690&partnerID=8YFLogxK

U2 - 10.1002/nav.20126

DO - 10.1002/nav.20126

M3 - Journal article

SN - 0894-069X

VL - 53

SP - 91

EP - 100

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 1

ER -

The bottleneck problem with minimum quantity commitments

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this